原书出处
Introduction to Algorithms, Fourth Edition
22 第22章 单源最短路径
dges of a weighted, directed graph that has been initialized by INITIALIZE-SINGLE-SOURCE.
Lemma 22.11 (Upper-bound property) Let G = (V, E) be a weighted, directed graph with weight function w : E → ℝ. Let s ∈ V be the source vertex, and let the graph be initialized by INITIALIZE-SINGLE-SOURCE(G, s
). Then, v.d ≥ δ(s, v) for all v ∈ V, and this invariant is maintained over any sequence o
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter022.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea