You are given a directed graph with vertices and edges. Find the maximum number of edge-disjoint paths from vertex to vertex . Output the number of paths and list each path. Paths are edge-disjoint if they do not share any edges (but can share vertices).
This is a max flow problem where each edge has capacity . The flow value equals the number of disjoint paths. Then you need to extract the actual paths from the flow.