← 返回卡片

原书出处

Introduction to Algorithms, Fourth Edition

23 第23章 所有结点对的最短路径

Fourth edition · 核验版本的摘录快照 · 导入于 2026-10-23T08:18:08.735Z

returns the completed D matrix. Figure 23.6 depicts the execution of Johnson’s algorithm.

If the min-priority queue in Dijkstra’s algorithm is implemented by a Fibonacci heap, Johnson’s algorithm runs in O(V2 lg V + VE) time. The simpler binary min-heap implementation yields a running time of O(VE lg V), which

is still asymptotically faster than the Floyd-Warshall algorithm if the graph is sparse.

此预览只包含定位所需的摘录和上下文。

原书定位详情

来源:a19c7933-4eda-4176-aebd-30fe7e1ad292

正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter023.xhtml

EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea