Returns the average connectivity of a graph G.
The average connectivity \(\bar{\kappa}\) of a graph G is the average of local node connectivity over all pairs of nodes of G [R212] .
Parameters: | G : NetworkX graph
flow_func : function
|
---|---|
Returns: | K : float
|
See also
local_node_connectivity(), node_connectivity(), edge_connectivity(), maximum_flow(), edmonds_karp(), preflow_push(), shortest_augmenting_path()
References
[R212] | (1, 2) Beineke, L., O. Oellermann, and R. Pippert (2002). The average connectivity of a graph. Discrete mathematics 252(1-3), 31-45. http://www.sciencedirect.com/science/article/pii/S0012365X01001807 |