Evaluation of Kruskal

• Let G have n vertices and m edges.

• Sort the edges - O(m log m).

• Traverse the sorted edge list doing PC-Finds and W-Unions - O(m a(m,n)).

• Total time is O(m log m).

Previous slide

Next slide

Back to first slide

View graphic version