In the following problems, use the basic graph exploration algorithms from class such as Explore, DFS, undirected connected components, topological sorting a DAG, BFS, SCC, Dijkstra's (with min-heap implementation), as black-box subroutines. For the MST algorithms (Prim's and Kruskal's) and max-flow algorithms (Ford-Fulkerson and Edmonds-Karp) the problem will make clear whether or not you are allowed or expected to use these algorithms