原书出处
Introduction to Algorithms, Fourth Edition
22 第22章 单源最短路径
ollowing lemma states the optimal-substructure property of shortest paths more precisely.
Lemma 22.1 (Subpaths of shortest paths are shortest paths) Given a weighted, directed graph G = (V, E) with weight function w : E → ℝ let p = 〈v0, v1,
… , vk〉 be a shortest path from vertex v0 to vertex vk and, for any i and j such that 0 ≤
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter022.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea