原书出处
Introduction to Algorithms, Fourth Edition
22 第22章 单源最短路径
erminates with v.d < ∞ when it is run on G. Proof The proof is left as Exercise 22.1-2. ▪
Theorem 22.4 (Correctness of the Bellman-Ford algorithm) Let BELLMAN-FORD be run on a weighted, directed graph G = (V, E) with source vertex s and weight function w : E → ℝ. If G contains no negative-weight cycles that
are reachable from s, then the algorithm returns TRUE, v.d = δ(s, v) for all vertices v ∈
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter022.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea