原书出处
Introduction to Algorithms, Fourth Edition
23 第23章 所有结点对的最短路径
to the graph G of Figure 23.1. Now suppose that G and G′ have no negative-weight cycles.
Define the function h(v) = δ(s, v) for all v ∈ V′. By the triangle inequality (Lemma 22.10 on page 633), we have h(v) ≤ h(u) + w(u, v) for all edges (u, v) ∈ E′. Thus, by defining reweighted edge weights ŵ
according to equation (23.10), we have ŵ(u, v) = w(u, v) + h(u) − h(v) ≥ 0, thereby satis
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter023.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea