The Simple, Elegant Algorithm That Makes Google Maps Possible | Motherboard

*3*

Shortest Path using Dijkstra's Algorithm - YouTube

*1*

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...

Edsger Dijkstra quotes quotations and aphorisms from OpenQuotes #quotes #quotations #aphorisms #openquotes #citation

*1*

Dijkstra's Algorithm For those who are confused about the path A, E, D, F being the candidate for the answer, Dijkstras algorithm is a greedy algorithm meaning that it will always choose the thing that seems to best right now (without regard for how it may impact future choices). In this case, it chose A-B instead of A-E because the distance 4 < 7, hence ignoring the possibility of having a smaller path. This is what makes it greedy; it always goes for the next easiest solution.