networkx.algorithms.connectivity.connectivity.node_connectivity¶

node_connectivity
(G, s=None, t=None, flow_func=None)[source]¶ Returns node connectivity for a graph or digraph G.
Node connectivity is equal to the minimum number of nodes that must be removed to disconnect G or render it trivial. If source and target nodes are provided, this function returns the local node connectivity: the minimum number of nodes that must be removed to break all paths from source to target in G.
Parameters:  G (NetworkX graph) – Undirected graph
 s (node) – Source node. Optional. Default value: None.
 t (node) – Target node. Optional. Default value: None.
 flow_func (function) – A function for computing the maximum flow among a pair of nodes.
The function has to accept at least three parameters: a Digraph,
a source node, and a target node. And return a residual network
that follows NetworkX conventions (see
maximum_flow()
for details). If flow_func is None, the default maximum flow function (edmonds_karp()
) is used. See below for details. The choice of the default function may change from version to version and should not be relied on. Default value: None.
Returns: K – Node connectivity of G, or local node connectivity if source and target are provided.
Return type: integer
Examples
>>> # Platonic icosahedral graph is 5nodeconnected >>> G = nx.icosahedral_graph() >>> nx.node_connectivity(G) 5
You can use alternative flow algorithms for the underlying maximum flow computation. In dense networks the algorithm
shortest_augmenting_path()
will usually perform better than the defaultedmonds_karp()
, which is faster for sparse networks with highly skewed degree distributions. Alternative flow functions have to be explicitly imported from the flow package.>>> from networkx.algorithms.flow import shortest_augmenting_path >>> nx.node_connectivity(G, flow_func=shortest_augmenting_path) 5
If you specify a pair of nodes (source and target) as parameters, this function returns the value of local node connectivity.
>>> nx.node_connectivity(G, 3, 7) 5
If you need to perform several local computations among different pairs of nodes on the same graph, it is recommended that you reuse the data structures used in the maximum flow computations. See
local_node_connectivity()
for details.Notes
This is a flow based implementation of node connectivity. The algorithm works by solving \(O((n\delta1+\delta(\delta1)/2))\) maximum flow problems on an auxiliary digraph. Where \(\delta\) is the minimum degree of G. For details about the auxiliary digraph and the computation of local node connectivity see
local_node_connectivity()
. This implementation is based on algorithm 11 in [1].See also
local_node_connectivity()
,edge_connectivity()
,maximum_flow()
,edmonds_karp()
,preflow_push()
,shortest_augmenting_path()
References
[1] AbdolHossein Esfahanian. Connectivity Algorithms. http://www.cse.msu.edu/~cse835/Papers/Graph_connectivity_revised.pdf