原书出处
Introduction to Algorithms, Fourth Edition
20 第20章 基本图算法
V| adjacency lists is Θ(E), the total time spent in scanning adjacency lists is O(V + E).
The overhead for initialization is O(V), and thus the total running time of the BFS procedure is O(V + E). Thus, breadth-first search runs in time linear in the size of the adjacency-list representation of G.
Shortest paths Now, let’s see why breadth-first search finds the shortest distance from a
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter020.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea