Dijkstra's Algorithm example

My attempt to explain Dijkstra's Algorithm (shortest route) through an example.
Please let me know of any mistakes!
Also, my voice is terrible so I put Mozart's Sonata no. 16 (or simply K545) as the background music.

Category:

Education

Tags:

• dijkstra
• algorithm
• graph
• least
• distance
• example

[kingmcbrian]

i feel so posh right now :D

[jamesjiao]

I'd probably use the word 'cost' instead of 'distance'.

[iChoobies]

awesome awesome!!!! wickedly done... and the classical music background made it quite nice to understand

[dylusiya]

finally i get the point.. thanks dude..

[jamesjiao]

You've just made it look so easy.

[ItsVicc]

@shutterbugsow u only update the distance if the new distance is smaller. In this case, the old distance is 7 and the new distance is 10 so u don't update it.

[shutterbugsow]

You went wrong with the vertex f. Its distance value should be update to 10,while calculating its distance when vertex i is selected.

[wishkah256]

thanks a lot!

[pitthe123]

Wow, this is great! Thank you so much, you helped me understanding it ;)