networkx.algorithms.connectivity.cuts.minimum_st_node_cut¶

minimum_st_node_cut
(G, s, t, flow_func=None, auxiliary=None, residual=None)[source]¶ Returns a set of nodes of minimum cardinality that disconnect source from target in G.
This function returns the set of nodes of minimum cardinality that, if removed, would destroy all paths among source and target in G.
Parameters:  G (NetworkX graph)
 s (node) – Source node.
 t (node) – Target node.
 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.  auxiliary (NetworkX DiGraph) – Auxiliary digraph to compute flow based node connectivity. It has to have a graph attribute called mapping with a dictionary mapping node names in G and in the auxiliary digraph. If provided it will be reused instead of recreated. Default value: None.
 residual (NetworkX DiGraph) – Residual network to compute maximum flow. If provided it will be reused instead of recreated. Default value: None.
Returns: cutset – Set of nodes that, if removed, would destroy all paths between source and target in G.
Return type: Examples
This function is not imported in the base NetworkX namespace, so you have to explicitly import it from the connectivity package:
>>> from networkx.algorithms.connectivity import minimum_st_node_cut
We use in this example the platonic icosahedral graph, which has node connectivity 5.
>>> G = nx.icosahedral_graph() >>> len(minimum_st_node_cut(G, 0, 6)) 5
If you need to compute local st cuts between several pairs of nodes in the same graph, it is recommended that you reuse the data structures that NetworkX uses in the computation: the auxiliary digraph for node connectivity and node cuts, and the residual network for the underlying maximum flow computation.
Example of how to compute local st node cuts reusing the data structures:
>>> # You also have to explicitly import the function for >>> # building the auxiliary digraph from the connectivity package >>> from networkx.algorithms.connectivity import ( ... build_auxiliary_node_connectivity) >>> H = build_auxiliary_node_connectivity(G) >>> # And the function for building the residual network from the >>> # flow package >>> from networkx.algorithms.flow import build_residual_network >>> # Note that the auxiliary digraph has an edge attribute named capacity >>> R = build_residual_network(H, 'capacity') >>> # Reuse the auxiliary digraph and the residual network by passing them >>> # as parameters >>> len(minimum_st_node_cut(G, 0, 6, auxiliary=H, residual=R)) 5
You can also use alternative flow algorithms for computing minimum st node cuts. For instance, 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 >>> len(minimum_st_node_cut(G, 0, 6, flow_func=shortest_augmenting_path)) 5
Notes
This is a flow based implementation of minimum node cut. The algorithm is based in solving a number of maximum flow computations to determine the capacity of the minimum cut on an auxiliary directed network that corresponds to the minimum node cut of G. It handles both directed and undirected graphs. This implementation is based on algorithm 11 in [1].
See also
minimum_node_cut()
,minimum_edge_cut()
,stoer_wagner()
,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