To find disjoint paths in a network graph

I want to find maximum disjoint paths of a network graph and want to save all those nodes/edges.I need help for it .You can assume edge capacity is 1 for all edges (so that maxflow = disjoint paths) .

Thank You
Topic archived. No new replies allowed.