finds at most k vertex-independent paths from vertex s to vertex t in the graph g.
uses rules vw to specify the graph g.
- Vertex-independent paths are also known as independent paths or vertex disjoint paths.
- FindVertexIndependentPaths returns a list of vertex-independent paths from s to t.
- Each path is given as a list of vertices.
- FindVertexIndependentPaths works with undirected graphs, directed graphs, multigraphs, and mixed graphs.
Examplesopen allclose all
Basic Examples (1)
Properties & Relations (2)
Introduced in 2014
|Updated in 2015