原书出处
Introduction to Algorithms, Fourth Edition
21 第21章 最小生成树
yclic subset T ⊆ E that connects all of the vertices and whose total weight is minimized.
Since T is acyclic and connects all of the vertices, it must form a tree, which we call a spanning tree since it “spans” the graph G. We call the problem of determining the tree T the minimum-spanning-tree problem.1 Figure 21.1 shows
an example of a connected graph and a minimum spanning tree. This chapter studies two way
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter021.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea