原书出处
Introduction to Algorithms, Fourth Edition
21 第21章 最小生成树
list in order 7 if FIND-SET(u) ≠ FIND-SET(v) 8 A = A ∪ {(u, v)} 9 UNION(u, v) 10 return A
The running time of Kruskal’s algorithm for a graph G = (V, E) depends on the specific implementation of the disjoint-set data structure. Let’s assume that it uses the disjoint-set-forest implementation of Section 19.3 with
the union-by-rank and path-compression heuristics, since that is the asymptotically faste
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter021.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea