FindVertexIndependentPaths

FindVertexIndependentPaths[g, s, t, k] finds at most k vertex-independent paths from vertex s to vertex t in the graph g.

• FindVertexIndependentPaths[{v -> w, ...}, ...] uses rules v -> w to specify the graph g.

Examples

Find vertex-independent paths in a graph:

g = CompleteGraph[5];
FindVertexIndependentPaths[g, 1, 5, 3]

Highlight the paths:

paths = FindVertexIndependentPaths[g, 1, 5, 3];
HighlightGraph[g, paths]

Please visit the official Wolfram Language Reference for more details.