Pinterest • The world’s catalogue of ideas

Dijkstra's algorithm essentially uses breadth first search with greedy approach to come up with the shortest distance between given two nodes. Here is a video that explains Dijkstra's algorithm with the help of examples and animations.

from Motherboard

The Simple, Elegant Algorithm That Makes Google Maps Possible

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