原书出处
Introduction to Algorithms, Fourth Edition
20 第20章 基本图算法
es v.d = δ(s, v) for each vertex v ∈ V. We first show that v.d bounds δ(s, v) from above.
Lemma 20.2 Let G = (V, E) be a directed or undirected graph, and suppose that BFS is run on G from a given source vertex s ∈ V. Then, for each vertex v ∈ V, the value v.d computed by BFS satisfies v.d ≥ δ(s, v) at all times, including at termination.
Proof The lemma is true intuitively, because any finite value assigned to v.d equals the
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter020.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea