WOLFRAM

Wolfram Language & System Documentation Center

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
Details and Options Details and Options
Examples  
Basic Examples  
Scope  
Properties & Relations  
Possible Issues  
See Also
Related Guides
History
Cite this Page

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 all close all

Basic Examples  (1)

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

Wolfram Language code: g = GraphData["ButterflyGraph"]
Wolfram Language code: FindEdgeIndependentPaths[g, 3, 4, 2]

Show the paths:

Wolfram Language code: HighlightGraph[g, PathGraph[#]] & /@ %

Scope  (6)

FindEdgeIndependentPaths works with undirected graphs:

Wolfram Language code: FindEdgeIndependentPaths[[image], 1, 6, 2]

Directed graphs:

Wolfram Language code: FindEdgeIndependentPaths[[image], 1, 6, 2]

Multigraphs:

Wolfram Language code: FindEdgeIndependentPaths[[image], 1, 6, 2]

Mixed graphs:

Wolfram Language code: FindEdgeIndependentPaths[[image], 1, 6, 2]

Use rules to specify the graph:

Wolfram Language code: FindEdgeIndependentPaths[{1 -> 2, 1 -> 5, 2 -> 3, 3 -> 4, 4 -> 5, 6 -> 3, 4 -> 6}, 1, 6, 2]

FindEdgeIndependentPaths works with large graphs:

Wolfram Language code: g = GridGraph[{10, 10, 10, 10}];
Wolfram Language code: FindEdgeIndependentPaths[g, 3, 10, 3]//Timing

Properties & Relations  (2)

FindEdgeIndependentPaths only returns simple paths:

Wolfram Language code: FindEdgeIndependentPaths[[image], 1, 3, 3]

EdgeConnectivity gives the maximum number of edge-independent paths:

Wolfram Language code: g = ExampleData[{"NetworkGraph", "ZacharyKarateClub"}];
Wolfram Language code: FindEdgeIndependentPaths[g, 1, 32, Infinity]//Length
Wolfram Language code: EdgeConnectivity[g, 1, 32]

Possible Issues  (1)

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

Wolfram Language code: g = GridGraph[{2, 3}];
Wolfram Language code: FindEdgeIndependentPaths[g, 2, 5, Infinity]
Wolfram Language code: HighlightGraph[g, PathGraph[#]]& /@ %

Another edge-independent path:

Wolfram Language code: HighlightGraph[g, PathGraph[{2, 4, 3, 5}]]
Wolfram Research (2014), FindEdgeIndependentPaths, Wolfram Language function, https://reference.wolfram.com/language/ref/FindEdgeIndependentPaths.html (updated 2015).

Text

Wolfram Research (2014), FindEdgeIndependentPaths, Wolfram Language function, https://reference.wolfram.com/language/ref/FindEdgeIndependentPaths.html (updated 2015).

CMS

Wolfram Language. 2014. "FindEdgeIndependentPaths." Wolfram Language & System Documentation Center. Wolfram Research. Last Modified 2015. https://reference.wolfram.com/language/ref/FindEdgeIndependentPaths.html.

APA

Wolfram Language. (2014). FindEdgeIndependentPaths. Wolfram Language & System Documentation Center. Retrieved from https://reference.wolfram.com/language/ref/FindEdgeIndependentPaths.html

BibTeX

@misc{reference.wolfram_2026_findedgeindependentpaths, author="Wolfram Research", title="{FindEdgeIndependentPaths}", year="2015", howpublished="\url{https://reference.wolfram.com/language/ref/FindEdgeIndependentPaths.html}", note=[Accessed: 12-June-2026]}

BibLaTeX

@online{reference.wolfram_2026_findedgeindependentpaths, organization={Wolfram Research}, title={FindEdgeIndependentPaths}, year={2015}, url={https://reference.wolfram.com/language/ref/FindEdgeIndependentPaths.html}, note=[Accessed: 12-June-2026]}