New Algorithm for Shortest Paths Based on Node Combination
Yuejin Tan · Journal of Chinese Computer Systems · 2009
This paper proposes a Node Combination algorithm for the Shortest-Path of real-weighted networks.By the method of dragging the start node's nearest neighbor to itself,it combines the nearest node repeatedly,and finally gains the lengths of the shortest paths between the start node and all other nodes.Compared with the Dijkstra algorithm,it is a new algorithm without node labeling operations,it takes no but the start node's neighbors into account all the time.While the whole process could be manipulated with vectors,it is more comprehensible and convenient for programming.With the experimental evaluation on a variety of networks,it shows that it gains more computing efficiency than Dijkstra.