原书出处
Introduction to Algorithms, Fourth Edition
20 第20章 基本图算法
(V, E) with source s, we define the predecessor subgraph of G as Gπ = (Vπ, Eπ), where and
The predecessor subgraph Gπ is a breadth-first tree if Vπ consists of the vertices reachable from s and, for all v ∈ Vπ, the subgraph Gπ contains a unique simple path from s to v that is also a shortest path from s to v in G.
A breadth-first tree is in fact a tree, since it is connected and |Eπ| = |Vπ| − 1 (see Th
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter020.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea