原书出处
Introduction to Algorithms, Fourth Edition
21 第21章 最小生成树
clic, since it is a subset of a minimum spanning tree and a tree may not contain a cycle.
At any point in the execution, the graph GA = (V, A) is a forest, and each of the connected components of GA is a tree. (Some of the trees may contain just one vertex, as is the case, for example, when the method begins: A is empty
and the forest contains |V| trees, one for each vertex.) Moreover, any safe edge (u, v) f
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter021.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea