原书出处
Introduction to Algorithms, Fourth Edition
21 第21章 最小生成树
sing G to decrease the number of vertices before running Prim’s algorithm. In particular,
for each vertex u, choose the minimum-weight edge (u, v) incident on u, and put (u, v) into the minimum spanning tree under construction. Then, contract all chosen edges (see Section B.4). Rather than contracting these
edges one at a time, first identify sets of vertices that are united into the same new ve
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter021.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea