Research Article
Development of Data Fusion Method Based on Topological Relationships Using IndoorGML Core Module
Algorithm 1
Dijkstra’s algorithm operation.
| | | (a) Compare the costs of the edges connected to the start node(Ni) | | (b) Add node(Nj) connected to the edge(Ei) with the least cost to the path | | (c) The cost(Ci) of the edge(Ei) is allocated to the added node(Nj) | | (d) Performs (a) operation starting from node(Nj) | | (e) Add node(Nk) connected to the edge(Ej) with the least cost to the path | | (f) The cost of the route (Ck=Ci+Cj) is allocated to the added node(Nk) | | (g) Identify different paths between node(Ni) and node(Nk) | | (g1) Compared with the cost of another route(Cl) and | | the cost of allocated route(Ck) | | (g2) Reallocate the smaller cost to the node(Nk) with the minimum | | cost (Ck:=(Cl) or (Ck)) | | (h) Repeating (a) ~ (g) operations up to the destination node, calculating | | the minimum cost of the destination node |
|
