原书出处
Introduction to Algorithms, Fourth Edition
22 第22章 单源最短路径
the upper-bound property, we always have ∞ = δ(s, v) ≤ v.d, and thus v.d = ∞ = δ(s, v). ▪
Lemma 22.13 Let G = (V, E) be a weighted, directed graph with weight function w : E → ℝ, and let (u, v) ∈ E. Then, immediately after edge (u, v) is relaxed by a call of RELAX(u, v, w), we have v.d ≤ u.d + w
(u, v). Proof If, just prior to relaxing edge (u, v), we have v.d > u.d + w(u, v), then v.
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter022.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea