breadth first path. java

here is the question I need to answer correctly. here below I am also attaching the pictures of related content so that it could be useful for u to answer. please post the picture of output with answer

The Wiener index of a vertex is the sum of the shortest path distances between v and all other vertices. The Wiener index of a graph G is the sum of the shortest path distances over all pairs of vertices. It's used by mathematical chemists (vertices atoms, edges bonds) Modify BreadthFirstPaths.java to return the Wiener index of a graph. Find the shortest path distance for each pair of vertices, and sum all the paths. Start with tinyCG.txt, an easy graph, which you can do by hand to check your algorithm. Then generate the Wiener Index for Wiener.txt. Submit your .java program and the Index. The files are on Blackboard