1 votes 1 votes Is there any best method for implementing kruskal algorithm without using priority queue?? and can we use min heap here?? Algorithms kruskals-algorithm binary-heap + – G Shaheena asked Apr 5, 2018 retagged Jun 29, 2022 by makhdoom ghaya G Shaheena 197 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
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) abhishekmehta4u answered Apr 5, 2018 abhishekmehta4u comment Share Follow See all 0 reply Please log in or register to add a comment.