← 返回卡片

原书出处

Introduction to Algorithms, Fourth Edition

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

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

trix multiplication defined by the EXTEND-SHORTEST-PATHS procedure (see Exercise 23.1-4).

In fact, we can compute L(n−1) with only ⌈lg(n – 1)⌉ matrix products by using the technique of repeated squaring: Since 2⌈lg(n – 1)⌉ ≥ n – 1, the final product is . The procedure FASTER-APSP implements this idea. It

takes just the n × n matrix W and the size n as inputs. Each iteration of the while loop

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

原书定位详情

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

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

EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea