原书出处
Introduction to Algorithms, Fourth Edition
21 第21章 最小生成树
method. They each use a specific rule to determine a safe edge in line 3 of GENERIC-MST.
In Kruskal’s algorithm, the set A is a forest whose vertices are all those of the given graph. The safe edge added to A is always a lowest-weight edge in the graph that connects two distinct components. In Prim’s algorithm, the set A
forms a single tree. The safe edge added to A is always a lowest-weight edge connecting t
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter021.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea