← 返回卡片

原书出处

Introduction to Algorithms, Fourth Edition

22 第22章 单源最短路径

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

f predecessors originating at a vertex v runs backward along a shortest path from s to v.

Thus, given a vertex v for which v.π ≠ NIL, the procedure PRINT-PATH(G, s, v) from Section 20.2 prints a shortest path from s to v. In the midst of executing a shortest-paths algorithm, however, the π values might not indicate shortest paths.

The predecessor subgraph Gπ = (Vπ, Eπ) induced by the π values is defined the same for si

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

原书定位详情

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

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

EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea