原书出处
Introduction to Algorithms, Fourth Edition
20 第20章 基本图算法
shortest-path distances, we investigate an important property of shortest-path distances.
Lemma 20.1 Let G = (V, E) be a directed or undirected graph, and let s ∈ V be an arbitrary vertex. Then, for any edge (u, v) ∈ E, δ(s, v) ≤ δ(s, u) + 1.
Proof If u is reachable from s, then so is v. In this case, the shortest path from s to v
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter020.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea