原书出处
Introduction to Algorithms, Fourth Edition
B 附录B 集合等离散数学基础
d since u and v were chosen arbitrarily, G is connected. ▪ B.5.2 Rooted and ordered trees
A rooted tree is a free tree in which one of the vertices is distinguished from the others. We call the distinguished vertex the root of the tree. We often refer to a vertex of a rooted
tree as a node5 of the tree. Figure B.6(a) shows a rooted tree on a set of 12 nodes with
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/appendix002.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea