原书出处
Introduction to Algorithms, Fourth Edition
B 附录B 集合等离散数学基础
us its out-degree. Vertex 2 in Figure B.2(a) has in-degree 2, out-degree 3, and degree 5.
A path of length k from a vertex u to a vertex u′ in a graph G = (V, E) is a sequence 〈v0, v1, v2,
… , vk〉 of vertices such that u = v0, u′ = vk, and (vi−1, vi) ∈ E for i = 1, 2, … , k. Th
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/appendix002.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea