原书出处
Introduction to Algorithms, Fourth Edition
23 第23章 所有结点对的最短路径
e-weight cycle using weight function ŵ. Proof We start by showing that We have Therefore,
any path p from v0 to vk has ŵ(p) = w(p) + h(v0) − h(vk). Because h(v0) and h(vk) do not depend on the path, if one path from v0 to vk is shorter than another using weight function w, then it is also
shorter using ŵ. Thus, w(p) = δ(v0, vk) if and only if . Finally, we show that G has a ne
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter023.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea