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 allSee Also
FindVertexIndependentPaths FindShortestPath FindPath PathGraph
Related Guides
Introduced in 2014
(10.0)
| Updated in 2015 (10.3)