graph-generation

Discussed in networkx/networkx#4918

There are Four Centrality Measures not found in NetworkX, Leverage Centrality, Bridging Centrality, Laplace Centrality, and Communicability. It would be useful if there are guides on including these into NetworkX.

def Leverage_Centrality(g):
    DegreeI = g.degree(nbunch = i)
    NeighboorsI = [n for n in g.neighbors(i

I have a gh graph on 37700 vertices and 289003 edges.

Calculation of its diameter like this:

maximum(maximum(gdistances(gh, i)) for i in vertices(gh))

takes around 250 seconds (probably this is not an optimal algorithm for the task but at least it works).

However, when I run diameter(gh) the process takes so long that I did not wait till it finished.