Prim's Algorithm: Minimal Spanning Tree

Hey hope you are doing alright just I wanna say that
GOD loved the world so much he sent his only begotten
son Jesus to die a brutal death for us so that we can have eternal life and we can all accept this amazing gift this by simply trusting in Jesus, confessing that GOD raised him from the dead, turning away from your sins and forming a relationship with GOD.

The best explanation ever!

thank you sir

This video explains the algorithm very well!

What is the differnce between minimum spanning tree and a minimmal spanning tree of a graph?

I think he forgot to mention that you can't have any cycles

I thought this was Khan Academy!
But anyways thank you :)

This was so confusing the way my prof explained in class, yet the way you explained it in this video I got it in 2 minutes, and now I have that part of the final down. Thank you.

How to selected weight IF same weight ?

💖 Thanks for this! ✨ 😻 😍

I have a test in 50 minutes and was hella stressed cause this problem was giving me hella trouble. Thank you so much.

Great simple explanation!

Hey Barry, is minimal spanning tree same as Dijkstra's Algorithm?

Dude! I think I was in one of your classes (quite a few years back) at Sierra College! Great job on the video! Unfortunately the computer science world is saturated with videos of terrible quality that are difficult to understand. You made the concept of a spanning tree very simple to understand, thank you!

tyyy !

excellent!!!

Beautifully explained, thank you!

Thank you really well explained

genius

I think there is another possibility of path with same minimum spanning tree length of 22 if anybody found please comment here

thanks

Great video, really helped me out. But I was wondering, what's the difference between Prim's algorithm and Dijkstra's algorithm. As I understand it, both figure out the minimum spanning trees for a given graph in about the same way.

Just awesome! Thank you

well done

thanks sir

You're awesome Mr Brown!

Implementations?

Thank you!!!!!!

cheers barry mate

good enough for me. better than lecture...and the man leading my lecture is the nephew of Kruskal who founded Kruskals algorithm, Clyde.

Great! Thanks for the clear explanation.

good

Thank you dear

best explanation of prims algorithm by far

Legend.

Great video!

Would you not pick H going to E directly (weight: 4), instead of going from H => F => E =>Total Weight: 7 ?

and fir the maximum would you do the same thing but look for the maximum instead
?

great presentation. my professor says to start with the one with the most degrees. Does it matter where to start?

awesome vedio

This is great. thanks

you are a boss, helped me out xx

very much clear, even a stupid will can understand, thx so much professor

legend. thanks a lot :)

High Five!
:D

great video..👍

great video, thank you!

The video is great. Thank you so much

Thank you ! This video explains it perfectly!