原书出处
Introduction to Algorithms, Fourth Edition
22 第22章 单源最短路径
the relaxation, then neither u.d nor v.d changes, and so v.d ≤ u.d + w(u, v) afterward. ▪
Lemma 22.14 (Convergence property) Let G = (V, E) be a weighted, directed graph with weight function w : E → ℝ, let s ∈ V be a source vertex, and let s ⇝ u → v be a shortest path in G for some vertices u, v ∈ V.
Suppose that G is initialized by INITIALIZE-SINGLE-SOURCE(G, s) and then a sequence of re
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter022.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea