原书出处
Introduction to Algorithms, Fourth Edition
23 第23章 所有结点对的最短路径
n which the entry in u’s row and v’s column is the weight of a shortest path from u to v.
You can solve an all-pairs shortest-paths problem by running a single-source shortest-paths algorithm |V| times, once with each vertex as the source. If all edge weights are nonnegative, you can use Dijkstra’s algorithm. If
you implement the min-priority queue with a linear array, the running time is O(V3 + VE)
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter023.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea