Shortest path
https://www.wikiwand.com/en/Shortest_path_problem
- ### Single-source
- Dijkstra's
- Bellman-Ford
- Breadth-first (unweighted)
- Topological sorting (weighted DAGs)
- ### Single pair
- ### All pairs
- Floyd-Warshall
- Johnson's (potentially faster on sparse graphs)
- ### Stochastic