Finding the shortest path using Dijkstra's Algorithm

This video demonstrates the implementation of Dijkstra's algorithm to find the shortest path between two locations.

[Melsi]

The explanation is so simple, it worked for me, I totally recommend this video. Thank you!

[fastest]

So helpful. You went through the algorithm and explained everything really well. Thank you so much :)

[delwynmonaghan]

thanks for the video. Great explanation. I'm in dkit myself and this is helping day before exam :)

[jilliansolomon]

Karen you're a star! Thanks from the USA :D

[abufrasaa]

Thank you for this, I am from Saudi Arabia and you are the best

[SamiCoolVibes]

Karen, thank u so much for this video, i failed my algorithm exam but sitting for a repeat in 5 days, please Karen i need a miracle, I NEED MORE OF THIS TOUGH EXERCISES TO PRACTICE FOR THE UPCOMING EXAM, PLEASE HELP!!

[TheAVIACAO]

Thank you for this, im from Brazil and i coudlnt find anything better! Thank youuu

[danamuise]

whats the difference between Dijkstra's and Prims? (except Prims can start at any node?)

[sushmabehara]

karen u are awesome. i always watch your videos. :)

[PatrykDobrowolski]

IMHO it's not strict Dijkstra's algorithm.

[rishiswethan]

As you said that this is a greedy algorithm in the end, is the path that we just found the shortest?

[mycloud]

Thanks mam, useful video. You got a nice voice btw ;)

[sosocinderella]

Hi its nice explanation its worked good with we, , , I study software engineering I dont know why they teach us this I cant...m

[arunsharma-tcjv]

great job   much helpfull for me  thank u very much  sir

[debasishraychawdhuri]

There is no reason why CD and BE are not considered as options

[Joredos]

If you have no algorithmic mind you could not be a good software engineer.

[InspectorKassaar]

Some pathological woman haters here are making fools of themselves. They'd better watch Karen's video called "Finding the Minimal Spanning Tree using Prim's Algorithm". :-)