Topology structure and centrality in a java source code

Call graph plays a very important role in program analysis, and it has been widely used in software engineering (e.g., program understanding, compiling optimization, regression test, etc). In the present paper, we studied the source code structure of a Java program from a call graph perspective. We check the basal network properties of the call graph. By comparing several familiar centrality measures (betweenness, closeness, eccentricity, HITS-Authority and PageRank) and applying them to the call graph, we also give the centrality analysis of the call graph.