← 返回卡片

原书出处

Introduction to Algorithms, Fourth Edition

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

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

ontains a path from i to j for all vertex pairs i, j ∈ V, without regard to edge weights.

We define the transitive closure of G as the graph G* = (V, E*), where E* = {(i, j) : there is a path from vertex i to vertex j in G}. One way to compute the transitive closure of a graph in Θ(n3) time is to assign a

weight of 1 to each edge of E and run the Floyd-Warshall algorithm. If there is a path fr

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

原书定位详情

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

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

EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea