retagged by
197 views

1 Answer

0 votes
0 votes

 using priority queue is implementation of kruskal algorithm is efficient. becz we need to always minimum edge weight so we use  priority queue  as a min-Heap.

  •   priority queue  as a min-Heap.--->o(logn)       
  •  priority queue  as a array .-------> o(N)

Related questions

2 votes
2 votes
2 answers
1
Psy Duck asked Jun 24, 2023
910 views
Can anyone help in solving the question 105 to 109.I don't have answer key I want to confirm my answer ...i will update my answer in the comments.
0 votes
0 votes
1 answer
3
0 votes
0 votes
2 answers
4
Mak Indus asked Nov 10, 2018
372 views