finds at most k edge-independent paths from vertex s to vertex t in the graph g.
uses rules vw to specify the graph g.
- 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)
FindEdgeIndependentPaths works with undirected 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:
Wolfram Research (2014), FindEdgeIndependentPaths, Wolfram Language function, https://reference.wolfram.com/language/ref/FindEdgeIndependentPaths.html (updated 2015).
Wolfram Language. 2014. "FindEdgeIndependentPaths." Wolfram Language & System Documentation Center. Wolfram Research. Last Modified 2015. https://reference.wolfram.com/language/ref/FindEdgeIndependentPaths.html.
Wolfram Language. (2014). FindEdgeIndependentPaths. Wolfram Language & System Documentation Center. Retrieved from https://reference.wolfram.com/language/ref/FindEdgeIndependentPaths.html