This documents an unmaintained version of NetworkX. Please upgrade to a maintained version and see the current NetworkX documentation.
Connectivity and cut algorithms
Moody and White algorithm for k-components
||Returns the k-component structure of a graph G.|
Kanevsky all minimum node k cutsets algorithm.
||Returns all minimum k cutsets of an undirected graph G.|
Flow based connectivity algorithms
||Returns the average connectivity of a graph G.|
||Compute node connectivity between all pairs of nodes of G.|
||Returns the edge connectivity of the graph or digraph G.|
||Returns local edge connectivity for nodes s and t in G.|
||Computes local node connectivity for nodes s and t.|
||Returns node connectivity for a graph or digraph G.|
Flow-based Minimum Cuts¶
Flow based cut algorithms
||Returns a set of edges of minimum cardinality that disconnects G.|
||Returns a set of nodes of minimum cardinality that disconnects G.|
||Returns the edges of the cut-set of a minimum (s, t)-cut.|
||Returns a set of nodes of minimum cardinality that disconnect source from target in G.|
Stoer-Wagner minimum cut¶
Stoer-Wagner minimum cut algorithm.
||Returns the weighted minimum edge cut using the Stoer-Wagner algorithm.|