Can someone succinctly explain how Dijkstra's algorithm works and how it may be used to find the shortest path for such a graph (from a to z)?
I've looked at some procedures online, but many of them seem to differ and it's hard to discern what I'm actually trying to accomplish.
Thanks for the help!
Best Answer
For now we have route a(0)-b(2);
Maybe this tutorial will help you: http://optlab-server.sce.carleton.ca/POAnimations2007/DijkstrasAlgo.html