原书出处
Introduction to Algorithms, Fourth Edition
B 附录B 集合等离散数学基础
) is an edge of a connected component only if both u and v are vertices of the component.
A directed graph is strongly connected if every two vertices are reachable from each other. The strongly connected components of a directed graph are the equivalence classes of vertices
under the “are mutually reachable” relation. A directed graph is strongly connected if it
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/appendix002.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea