Breadth first search

This program involves a Breadth First Sarch o a graph that is to be input from another file. Using the input file first build adjacency list data structure. Next choose any vertex(A)to start the breadth first search and let the result be the vertex(B) at the maximum distance from (A). Next run a breadth first search from (B) and let the result be the vertex(C) at the maximum distanc from (B). Next output the vertices on a pah from (B) to (C) to show the diameter of the tree. ## Deliverables Complete and fully-functional working program(s) in executable form as well as complete source code of all work done. Complete copyrights to all work purchased. The input file for the program for example is 1. The first line of the code is the number of vertices 2. The next x-1 lines gives an edge as an unordered pair of vertices 3. An example input file would be as follows: 5 0 3 1 0 1 4 2 1 All that is needed is the program to put the input file into an adjacency list and run a breadth first search on the graph s stated above. The breadth first search will only be ran twice in the entire program ## Platform The platform for this program will be a digital unix g++ compiler.