FindEdgeIndependentPaths

FindEdgeIndependentPaths[g,s,t,k]

finds at most k edge-independent paths from vertex s to vertex t in the graph g.

FindEdgeIndependentPaths[{vw,…},…]

uses rules vw to specify the graph g.

Details

  • Edge-independent paths are also known as edge-disjoint paths.
  • FindEdgeIndependentPaths returns a list of edge-independent paths from s to t.
  • Each path is given as a list of vertices.
  • FindEdgeIndependentPaths works with undirected graphs, directed graphs, multigraphs, and mixed graphs.

Examples

open allclose all

Basic Examples  (1)

Find edge-independent paths between two individual vertices in a graph:

In[1]:=
Click for copyable input
Out[1]=
In[2]:=
Click for copyable input
Out[2]=

Show the paths:

In[3]:=
Click for copyable input
Out[3]=

Scope  (6)

Properties & Relations  (2)

Possible Issues  (1)

See Also

FindVertexIndependentPaths  FindShortestPath  FindPath  PathGraph

Introduced in 2014
(10.0)
| Updated in 2015
(10.3)