edited by
527 views

1 Answer

0 votes
0 votes
in kruskal algo we are fir build a min heap of edge.

after delete one by one from min heap and simultaneously check for cycle cannot formed if formed discard that edge.

Related questions

1 votes
1 votes
0 answers
3
Shivam Chauhan asked Nov 2, 2017
712 views
First statement is False because complexity will be O(E2).I think the second statement is true? But not sure
1 votes
1 votes
1 answer
4
rahul sharma 5 asked Sep 27, 2017
544 views
Which algorithm does kruskal uses for detecting every cycle and what is the time complexity?