Let's build a graph with a vertex for every state in the USA. We create an (undirected) edge between two vertices if it is possible to fly from one state to the other in 3 hops/flights or fewer. This graph is...