FindEdgeIndependentPaths

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

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

Please visit the official Wolfram Language Reference for more details and examples on core symbols.