Speeding up the Floyd-Warshall algorithm for the cycled shortest path problem
暂无分享,去创建一个
[1] D. R. Fulkerson,et al. Flows in Networks. , 1964 .
[2] Giorgio Gallo,et al. Shortest path algorithms , 1988, Handbook of Optimization in Telecommunications.
[3] Andrew V. Goldberg,et al. Shortest paths algorithms: Theory and experimental evaluation , 1994, SODA '94.
[4] Richard Bellman,et al. ON A ROUTING PROBLEM , 1958 .
[5] Stephen Warshall,et al. A Theorem on Boolean Matrices , 1962, JACM.
[6] Edsger W. Dijkstra,et al. A note on two problems in connexion with graphs , 1959, Numerische Mathematik.
[7] RadzikTomasz,et al. Shortest paths algorithms , 1996 .