Problem
1. Determine the vertices that have the greatest distance from the vertex with label 1. By the distance from u to v we refer to the length of the shortest path that begins at u and ends at v.
2. For the vertex with the smallest integer label from the collection that you found in part 1, determine the length of the shortest path that starts at that vertex and ends at 1.
3. Determine number of pairs of vertices (u, v) such that 1 connects to u, u connects to v and v connects back to 1.