shortest path problems #Given a graph G, you often want to find the shortest path from one node to another. TODO: elaborate heredijkstra’s algorithm #The classic.floyd-warshall #TODObellman-ford #TODO