networkx.eccentricity
networkx.radius
Enter search terms or a module, class or function name.
Return the diameter of the graph G.
The diameter is the maximum of all pairs shortest path.