public class GraphProcessor

{

// other member fields and methods

// NOTE: graphData should be an absolute file path

public GraphProcessor(String graphData){

// implementation

}

}

Given an unweighted (directed/undirected) graph G = (V, E), let s(u, u) denote the length of the shortest path between u and v. If there is no path from u to v, then s(u, ) is defined as 2n where n is the number of vertices in G. Diameter of G is max s(u,). In other words, for (strongly) connected graphs, the diameter is the smallest number d such that there is a path of length S d between any pair of vertices. For graphs that are not (strongly) connected diameter is 2n Given a vertex V, centrality of x is the number of shortest paths the go via z. More precisely centrality(x) is the size of the following set: {(u, u | u, u V, at least one shortest path from u to u goes via z} Design a class named GraphProcessor. This class w have following constructor. GraphProcessor (String graphData) graphData hold the absolute path of a file that stores a directed graph. This file will be of the following format: First line indicates number of vertices. Given an unweighted (directed/undirected) graph G = (V, E), let s(u, u) denote the length of the shortest path between u and v. If there is no path from u to v, then s(u, ) is defined as 2n where n is the number of vertices in G. Diameter of G is max s(u,). In other words, for (strongly) connected graphs, the diameter is the smallest number d such that there is a path of length S d between any pair of vertices. For graphs that are not (strongly) connected diameter is 2n Given a vertex V, centrality of x is the number of shortest paths the go via z. More precisely centrality(x) is the size of the following set: {(u, u | u, u V, at least one shortest path from u to u goes via z} Design a class named GraphProcessor. This class w have following constructor. GraphProcessor (String graphData) graphData hold the absolute path of a file that stores a directed graph. This file will be of the following format: First line indicates number of vertices