Run-time of Kruskal’s Algorithm
Sorting: O(e log e)
# finds: e
# unions: n-1
Grand total: O(e loge + e a(e,n) )
Previous slide
Next slide
Back to first slide
View graphic version