calculating nodes, edges, average degree and average path length of a network
This python code computes the nodes, edges, average degree, average path length, betweenness centrality, closeness centrality and eigenvector centrality of a network. The data is in graphML format and has already been cleansed. It uses Python's NetworkX library.