Complexity of Kruskal’s algorithm for finding the minimum spanning tree of an…
PYQ GATE 1992
Complexity of Kruskal’s algorithm for finding the minimum spanning tree of an undirected graph containing n vertices and m edges if the edges are sorted is ________
Attempted by 2 students.
Sign up free to check your answer
Sign up freeLoading lesson…