原书出处
Introduction to Algorithms, Fourth Edition
20 第20章 基本图算法
earch finds the shortest distance from a given source vertex s to each vertex in a graph.
Define the shortest-path distance δ(s, v) from s to v as the minimum number of edges in any path from vertex s to vertex v. If there is no path from s to v, then δ(s, v) = ∞. We call a path of length δ(s, v) from s to v a shortest path2 from s to v.
Before showing that breadth-first search correctly computes shortest-path distances, we i
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter020.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea