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:

Show the paths:

Scope  (6)

FindEdgeIndependentPaths works with undirected graphs:

Directed graphs:

Multigraphs:

Mixed graphs:

Use rules to specify the graph:

FindEdgeIndependentPaths works with large graphs:

Properties & Relations  (2)

FindEdgeIndependentPaths only returns simple paths:

EdgeConnectivity gives the maximum number of edge-independent paths:

Possible Issues  (1)

Find a largest set of edge-independent paths between two vertices:

Another edge-independent path:

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