**These are all related to Graphs: Some examples of the topics in the chapter are: Breadth-First Traversal, Warshall's Algorithm, Algorithm to Produce a Spanning Tree from a Connected Undirected Graph, Dijkstra's Algorithm, Floyd's Algorithm **

A. Of the algorithms we studied, name the algorithm which would be used to determine the two-way roads to close a connecting group of towns, and still allow access to all towns?

B. Of the algorithms we studied, name the algorithm which would be used to determine the toll roads to travel to minimize the tolls when traveling from a given town to all other towns?

C. Of the algorithms we studied, name the algorithm which would be used to determine if there is a way to pass through all towns connected by one-way streets?

D. Of the algorithms we studied, name the algorithm which would be used to determine the cheapest fares between all the cities that an airline flies to?