Prim's Algorithm: Minimum Spanning Tree (MST)

456,858
0
Published 2016-06-23
Short example of Prim's Algorithm, graph is from "Cormen" book.

All Comments (21)
  • @nahux
    This is the most clear explanation I've seen. It contemplates everything, Thank you!!
  • @DB99SIL
    awesome video man, was struggling at first to get the concept and you helped nail it down for me. thank you!
  • Thank you so much. I was baffled with so many videos.But yours tutorial took my concepts on the track.
  • @cansngok8794
    This is the most clear explanation I've seen. Thank you so so so much
  • @tanthokg
    Your video helps me a lot. Thank you for your great work!
  • @kavereon
    Great explanation! Much better than my book and I finally understand it
  • @personaliTia
    Brilliant! Thank you for your clear explanation.
  • 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.
  • Nice explanation in a short amount of time..!!Keep it up!!!Thank you so much :)
  • @SaumyaSharma007
    Thanks a million Sir 👍👌🔥 4 years before but hasn't lost the charm 👍
  • @SuppaMan
    Thank you very much! Greetings from Italy!
  • @tin5180
    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
  • @siddsundar2464
    this is an excellent explanation. This will definitely help me for my data structures exam