← 返回卡片

原书出处

Introduction to Algorithms, Fourth Edition

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

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

ute the transitive closure of G in Θ(n3) time, which can save time and space in practice.

This method substitutes the logical operations ∨ (logical OR) and ∧ (logical AND) for the arithmetic operations min and + in the Floyd-Warshall algorithm. For i, j, k = 1, 2,

… , n, define to be 1 if there exists a path in graph G from vertex i to vertex j with al

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

原书定位详情

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

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

EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea