原书出处
Introduction to Algorithms, Fourth Edition
22 第22章 单源最短路径
δ(s, v) at all times afterward. Path-relaxation property (Lemma 22.15) If p = 〈v0, v1, …
, vk〉 is a shortest path from s = v0 to vk, and the edges of p are relaxed in the order (v0, v1), (v1, v2),
… , (vk−1, vk), then vk.d = δ(s, vk). This property holds regardless of any other relaxat
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter022.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea