- 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.
Examplesopen allclose all
Basic Examples (1)
Find edge-independent paths between two individual vertices in a graph:
Show the paths:
Properties & Relations (2)
Possible Issues (1)
Find a largest set of edge-independent paths between two vertices:
Another edge-independent path:
Introduced in 2014
Updated in 2015