原书出处
Introduction to Algorithms, Fourth Edition
22 第22章 单源最短路径
n unweighted graphs. The triangle inequality generalizes the property to weighted graphs.
Lemma 22.10 (Triangle inequality) Let G = (V, E) be a weighted, directed graph with weight function w : E → ℝ and source vertex s. Then, for all edges (u, v) ∈ E, δ(s, v) ≤ δ(s, u) + w(u, v). Proof Suppose
that p is a shortest path from source s to vertex v. Then p has no more weight than any o
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter022.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea