原书出处
Introduction to Algorithms, Fourth Edition
20 第20章 基本图算法
he same or form a sequence 〈k, k, … , k, k + 1, k + 1, … , k + 1〉 for some integer k ≥ 0.
Lemma 20.3 Suppose that during the execution of BFS on a graph G = (V, E), the queue Q contains the vertices 〈v1, v2,
… , vr〉, where v1 is the head of Q and vr is the tail. Then, vr.d ≤ v1.d + 1 and vi.d ≤ v
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter020.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea