Graph theory In java

In graph theory and network analysis, indicators of centrality identify the most important vertices within a graph. Applications include identifying the most influential person(s) in a social network, key infrastructure nodes in the Internet or urban networks, and super-spreaders of disease. Centrality concepts were first developed in social network analysis, and many of the terms used to measure centrality reflect their sociological origin1. The objective of this programming is to identify the most influential person in a social network, in order to do we need to apply the Closeness Centrality (CC) algorithm on a large graph representing a social network.
More details about algorithm in chat. Along with starting code