Shortest Paths

Dijkstra, Bellman-Ford, BFS on unweighted graphs.