minimum_node_cut(G, s=None, t=None, flow_func=None)
If source and target nodes are provided, this function returns the set of nodes of minimum cardinality that, if removed, would destroy all paths among source and target in G. If not, it returns a set of nodes of minimum cardinality that disconnects G.
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 .
Source node. Optional. Default value: None.
Target node. Optional. Default value: None.
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.
Set of nodes that, if removed, would disconnect G. If source and target nodes are provided, the set contains the nodes that if removed, would destroy all paths between source and target.
Returns a set of nodes of minimum cardinality that disconnects G.
edge_connectivity
meth
edmonds_karp
meth
maximum_flow
meth
minimum_cut
meth
minimum_edge_cut
meth
minimum_st_node_cut
meth
node_connectivity
meth
preflow_push
meth
stoer_wagner
meth
>>> # Platonic icosahedral graph has node connectivity 5
... G = nx.icosahedral_graph()
... node_cut = nx.minimum_node_cut(G)
... len(node_cut) 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 default edmonds_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
... node_cut == nx.minimum_node_cut(G, flow_func=shortest_augmenting_path) True
If you specify a pair of nodes (source and target) as parameters, this function returns a local st node cut.
>>> len(nx.minimum_node_cut(G, 3, 7)) 5
If you need to perform several local st cuts 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 minimum_st_node_cut
for details.
The following pages refer to to this document either explicitly or contain code examples using this.
networkx.algorithms.connectivity.cuts.minimum_node_cut
networkx.algorithms.connectivity.cuts.minimum_edge_cut
networkx.algorithms.connectivity.connectivity.local_node_connectivity
networkx.algorithms.connectivity.cuts.minimum_st_edge_cut
networkx.algorithms.connectivity.cuts.minimum_st_node_cut
Hover to see nodes names; edges to Self not shown, Caped at 50 nodes.
Using a canvas is more power efficient and can get hundred of nodes ; but does not allow hyperlinks; , arrows or text (beyond on hover)
SVG is more flexible but power hungry; and does not scale well to 50 + nodes.
All aboves nodes referred to, (or are referred from) current nodes; Edges from Self to other have been omitted (or all nodes would be connected to the central node "self" which is not useful). Nodes are colored by the library they belong to, and scaled with the number of references pointing them