Prim's Algorithm: Minimum Spanning Tree (MST)
456,858
Published 2016-06-23
All Comments (21)
-
This is the most clear explanation I've seen. It contemplates everything, Thank you!!
-
awesome video man, was struggling at first to get the concept and you helped nail it down for me. thank you!
-
saved me during finals man absolute stud
-
Thank you so much. I was baffled with so many videos.But yours tutorial took my concepts on the track.
-
This is the most clear explanation I've seen. Thank you so so so much
-
Your video helps me a lot. Thank you for your great work!
-
This totally helped me, you're explanation is clearer. Thank you!
-
Great explanation! Much better than my book and I finally understand it
-
Thanks a lot ....after a lot of search I got this helpful explanation.
-
Brilliant! Thank you for your clear explanation.
-
Genuinely clear explanation. Thank you!
-
Note: the spanning tree is not unique. Removal of edge (b,c) and replacing it with (a,h) gives a spanning tree with the same total distance.
-
Made me understand it in minutes!! Thank you!
-
Nice explanation in a short amount of time..!!Keep it up!!!Thank you so much :)
-
best explanation for prims algo that I've found
-
Thanks a million Sir 👍👌🔥 4 years before but hasn't lost the charm 👍
-
Thank you very much! Greetings from Italy!
-
I have a Decision Sciences exam on Monday (today being Saturday 1am) and you helped me cover 20% of a section in 6 minutes. Thank you kind sir
-
Simple and easy. Great job dude!
-
this is an excellent explanation. This will definitely help me for my data structures exam