原书出处
Introduction to Algorithms, Fourth Edition
B 附录B 集合等离散数学基础
t contains a cycle. The following theorem captures many important facts about free trees.
Theorem B.2 (Properties of free trees) Figure B.4 (a) A free tree. (b) A forest. (c) A graph that contains a cycle and is therefore neither a tree nor a forest. Let G = (V, E) be an
undirected graph. The following statements are equivalent. G is a free tree. Any two vert
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/appendix002.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea