Dijkstra's algorithm is an algorithm for finding the shortest paths between nodes in a graph, which may represent, for example, road networks.

It's a simple python implementation with some cool examples in the notebook. Check the notebook out (Dijkstra.ipynb)!