A New Algorithm for All-pairs Shortest Paths of Given Source-destination Pair
A new algorithm to find all the shortest paths from a specified source vertex to each other vertex is proposed in this paper through analyzing the most efficient algorithms Dijkstras Algorithm.The data structure used in this algorithm is simple and realizes easily .The running time of this algorithm is O(n2) as well as Dijkstras Algorithm.
shortest path Dijkstras algorithm predecessors list successors list contrary predecessors list graph
Tianzhi Li Fengsheng Xu
Department of Computer Science and Technology,Dezhou University,Dezhou,Shandong,253023,China
国际会议
大连
英文
26-29
2008-07-27(万方平台首次上网日期,不代表论文的发表时间)