Kruskals Algorithm Implementation

[@ifranrahman]

Searched whole youtube and found only your video most understable :) Thanks for explaining it in such easy way

[@ankitgaur5629]

thank you sir for this video. I was too confused but sir you simply explain the algorithm like there was nothing difficult. thanks again sir.

[@Abhishekkumar-vm7lj]

Thanks for explaining it in a simple way

[@ShwetaSingh-df8vo]

Sir you simply explain the algorithm like there was nothing difficult, Thank you so much. Kindly explain the implementation of pseudocode for Prim's algorithm also as explained for Kruskal's algorithm pseudocode in this video. Please share the video of Prims algorithm pseudocode as well.

[@nidhiverma1798]

awesome explanation

[@mkutkarsh]

Excellent explanation sir, thanks

[@dsid4172]

What implementation gives us O(log n)? If we didnt use Union by Rank or Path Compression, shouldn't Make-Set takes O(1), Union and Find both take O(n). If we use Union by Rank and Path Compression, Make-Set will still takes O(1) but m Find and Union will take (m a(n)) where a is the inverse of Ackermann function. Where does the log comes from?

[@anuragdutt2804]

can you make video on best case and worse case of it