Graphs: Dijkstra's Algorithm

How to find least-cost paths in a graph using Dijkstra's Algorithm.

This video is distributed under the Creative Commons Attribution 2.5 Canada License.

http://creativecommons.org/licenses/b...

• Category

  Education

[Hussain Miah]

That was a really good video, thank you so much I found this really confusing in the beginning but this really helped :)

[tookieblademcfly]

Really great video! Very simple and clear, and now I understand :D

[gLeviosa]

How could we go from H to G? There is no road between them. There is not even a road from H to anywhere.

[maarkat]

Wow. Thanks!

[Cần Nguyễn]

thanks !



[Aval Sawhney]

Now I finally understand the concept. Many thanks to you.

[Samar Essa]

Thank you soooooooo much

[Mohamed Elkammar]

Awesome! keep it up. Thank you.

[aiklarung]

Only gor the sake of a clarification; the "traveling salesman" problem you describe is not the hardest problem to solve. It's just somewhat hard if you want to brute force all paths (which is silly), but even that is not too hard by moderns standards (You can brute-force it in a GPU with CUDA now a days!) You can "solve" it cheaply by using genetic algorithms. Look it up :) Also, it's been thaught for too much time in universities by teachers who don't like to keep up-to-date.

[Dhiego Magalhães]

Interesting! I watched this because once i saw this problem of "best way to take to pass through all point with less cost" and one of the most difficult math problems now a days. This method isn't absolute is it?

[Emanuil Glavchev]

You're using a tablet? Or are just that good with the mouse? Great video! :) I'm planning myself something interesting in the field...