原书出处
Introduction to Algorithms, Fourth Edition
B 附录B 集合等离散数学基础
.2(b), the path 〈1, 2, 5, 1〉 is a simple cycle. A graph with no simple cycles is acyclic.
An undirected graph is connected if every vertex is reachable from all other vertices. The connected components of an undirected graph are the equivalence classes of vertices under the “is
reachable from” relation. The graph shown in Figure B.2(b) has three connected components
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/appendix002.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea