← GATE CSE 1991

Q03,vi

MSQMarks unknown

Kruskal’s algorithm for finding a minimum spanning tree of a weighted graph $G$ with $n$ vertices and $m$ edges has the time complexity of:

Sign in to save attempts.

Loading…