The diameter of an unweighted graph is the maximum of all the shortest distances between pairs of vertices in the graph.
a. Give an algorithm for computing the diameter of a graph.
b. What is the Big Oh performance of your algorithm in terms of the number of vertices and edges in the graph?
c. Implement your algorithm.
d. Discuss possible ways that you can improve the performance of the algorithm.