edge_disjoint_paths(G, s, t, flow_func=None, cutoff=None, auxiliary=None, residual=None)
Edge disjoint paths are paths that do not share any edge. The number of edge disjoint paths between source and target is equal to their edge connectivity.
This is a flow based implementation of edge disjoint paths. We compute the maximum flow between source and target on an auxiliary directed network. The saturated edges in the residual network after running the maximum flow algorithm correspond to edge disjoint paths between source and target in the original network. This function handles both directed and undirected graphs, and can use all flow algorithms from NetworkX flow package.
Source node for the flow.
Sink node for the flow.
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. The choice of the default function may change from version to version and should not be relied on. Default value: None.
Maximum number of paths to yield. Some of the maximum flow algorithms, such as edmonds_karp
(the default) and shortest_augmenting_path
support the cutoff parameter, and will terminate when the flow value reaches or exceeds the cutoff. Other algorithms will ignore this parameter. Default value: None.
Auxiliary digraph to compute flow based edge 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 network to compute maximum flow. If provided it will be reused instead of recreated. Default value: None.
If there is no path between source and target.
If source or target are not in the graph G.
A generator of edge independent paths.
Returns the edges disjoint paths between source and target.
edge_connectivity
meth
edmonds_karp
meth
maximum_flow
meth
node_disjoint_paths
meth
preflow_push
meth
We use in this example the platonic icosahedral graph, which has node edge connectivity 5, thus there are 5 edge disjoint paths between any pair of nodes.
>>> G = nx.icosahedral_graph()
... len(list(nx.edge_disjoint_paths(G, 0, 6))) 5
If you need to compute edge disjoint paths on 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 edge connectivity, and the residual network for the underlying maximum flow computation.
Example of how to compute edge disjoint paths among all pairs of nodes of the platonic icosahedral graph reusing the data structures.
>>> import itertools
... # You also have to explicitly import the function for
... # building the auxiliary digraph from the connectivity package
... from networkx.algorithms.connectivity import build_auxiliary_edge_connectivity
... H = build_auxiliary_edge_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")
... result = {n: {} for n in G}
... # Reuse the auxiliary digraph and the residual network by passing them
... # as arguments
... for u, v in itertools.combinations(G, 2):
... k = len(list(nx.edge_disjoint_paths(G, u, v, auxiliary=H, residual=R)))
... result[u][v] = k
... all(result[u][v] == 5 for u, v in itertools.combinations(G, 2)) True
You can also use alternative flow algorithms for computing edge disjoint paths. For instance, 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_pathSee :
... len(list(nx.edge_disjoint_paths(G, 0, 6, flow_func=shortest_augmenting_path))) 5
The following pages refer to to this document either explicitly or contain code examples using this.
networkx.algorithms.connectivity.disjoint_paths.edge_disjoint_paths
networkx.algorithms.connectivity.disjoint_paths.node_disjoint_paths
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