原书出处
Introduction to Algorithms, Fourth Edition
21 第21章 最小生成树
amortized time and each INSERT and DECREASE-KEY operation takes only O(1) amortized time.
Therefore, by using a Fibonacci heap to implement the min-priority queue Q, the running time of Prim’s algorithm improves to O(E+V lg V). Exercises 21.2-1 Kruskal’s algorithm can return different spanning trees for the
same input graph G, depending on how it breaks ties when the edges are sorted. Show that
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Introduction to Algorithms, Fourth Edition/_epub-src/OEBPS/chapter021.xhtml
EPUB SHA-256:ec7ced04bb875b93983816aef7a667855a4b71c5cf53b63406b9439c74e27aea