原书出处
Introduction to Algorithms, Fourth Edition
21 第21章 最小生成树
nd the blue edges form a minimum spanning tree. The total weight of the tree shown is 37.
This minimum spanning tree is not unique: removing the edge (b, c) and replacing it with the edge (a, h) yields another spanning tree with weight 37. The two algorithms are greedy algorithms, as described in Chapter 15. Each step
of a greedy algorithm must make one of several possible choices. The greedy strategy advo
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter021.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea