原书出处
Introduction to Algorithms, Fourth Edition
22 第22章 单源最短路径
orithm computes correct shortest-path weights for all vertices reachable from the source.
Lemma 22.2 Let G = (V, E) be a weighted, directed graph with source vertex s and weight function w : E → ℝ, and assume that G contains no negative-weight cycles that are reachable from s. Then, after the |V| − 1
iterations of the for loop of lines 2–4 of BELLMAN-FORD, 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