Dijkstra's algorithm

Dijkstra's algorithm is a way to find the quickest way between two places that are connected. It looks at all of the possible paths between the two places and picks the fastest one. It does this by looking at the distances between each of the places and adding them up. The shortest distance between two places is the path with the lowest number when adding up the distances!