原书出处
Introduction to Algorithms, Fourth Edition
22 第22章 单源最短路径
.d ≥ δ(s, v), and it cannot increase because relaxation steps do not increase d values. ▪
Corollary 22.12 (No-path property) Suppose that in a weighted, directed graph G = (V, E) with weight function w : E → ℝ, no path connects a source vertex s ∈ V to a given vertex v ∈ V. Then, after the graph is
initialized by INITIALIZE-SINGLE-SOURCE(G, s), we have v.d = δ(s, v) = ∞, and this equati
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter022.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea