原书出处
Introduction to Algorithms, Fourth Edition
22 第22章 单源最短路径
sequence of relaxation steps, then the predecessor subgraph Gπ is a shortest-paths tree.
Lemma 22.17 (Predecessor-subgraph property) Let G = (V, E) be a weighted, directed graph with weight function w : E → ℝ, let s ∈ V be a source vertex, and assume that G contains no negative-weight cycles that are
reachable from s. Then, after a call to INITIALIZE-SINGLE-SOURCE(G, s) followed by any se
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter022.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea