Understood in less than 5 minutes! Thank you so so much!

very nice explanation

Hannah Lodge

i still dont understand my lecturer give me question to find the shortet path from A to J

You save my day man. Thanks... 🤩

Lifesaver

Thank you for this!! (you have a nice voice though god)

Bro continues to save before finals. Thank you!

Genuinely clear explanation. Thank you!

Legit saved me hours befor the exam. Thank you so very much. You have a new subscriber now!

Excellent video, please do more.

Cool

Great video, you should renew them and also upload more.

Everything is clear except the writing

the path you choose is not the shortest path

thanks good job

thank you so muchhh!!!

6 years later and it still helps students like me

why did not you choose both edges with weight 8?

Good video, help me a lot

Sir is an application of dynamic programming

Thanks. This was much more efficient and understandable than the manner in which this content is usually presented.

hi dude, you still around?

How would you do it if you can’t backtrack? You went from C to I and the C to F. If you had to continue from the last point you reached, how would you make it efficient?

Is this the same as minimum cost arborescence?

Thanks my hero

what a king, ty

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

Great explanation! Not the best video/audio quality, but definitely way better than most videos about this topic

Amazing explanation. One question though, do you cross out the letters from the list only when the numerator and denominator are both filled?

Thank you! Your explanation is very simple, straightforward and easy to understand!

Well explained !! Thanks a lot, after seeing so many dumb videos your explanation helped me understand this fucking problem. :)

Nice

Finally a non-indian version, sick of these videos by indian guys with their accents

Recommended to watch at 1.25x speed . Good explanation by the way

Studying for my data structures exam that is in... four hours. Your videos on Kruskals, Prims, and Dijkstra's are saving my life because I missed those lectures. Cheers mate!

You open by saying Prim is the same as Kruskal. This is NOT true. Please be precise.

This is a great video. Thank you so much! God bless :)

best explanation for prims algo that I've found

Omg this is the best vdo of strongly connected components after I’ve watched for a few. Thanks so much please create more great content:)

kzbin.info/www/bejne/n4Spk5qwi9hqjs0

Thank you for explaining this in a simple and efficient way! (This lesson was even better than my tutor's LOL)

great example

great example video

Great and well put together! Thank you!

One improvement I would make would be this: When choosing between two edges with the same weight, choose randomly between them, but give a probability weighted by the degree of the node you are connecting to. In many real life networks, nodes with high degree tend to receive more new nodes than less connected nodes.

Again, short and simple to the point great video.

Short and simple, love the explanation.

Your mode of explanation is awesome, expecting more videos from your side, keep going..

TY m8 :))))