Maximum edge-disjoint paths
You are given a directed graph on n nodes (0..n-1) as edges [u, v], a source s, and a target t. Find the maximum number of edge-disjoint paths from s to t: paths that may share nodes but where no directed edge is used by more than one path. Return that maximum count (0 if t is unreachable or s == t). Constraints: up to 60 nodes; parallel edges allowed.
Implement
max_disjoint_paths(n: int, edges: list[list[int]], s: int, t: int) → intExamples
in
[4,[[0,1],[0,2],[1,3],[2,3]],0,3]out2What a strong answer looks like
State your approach and its time/space complexity out loud before you optimize. Handle the edge cases (empty input, duplicates, overflow), and say why you chose this over the brute force. Green tests are the floor, not the grade.
0:00 of about 30 min
solution.py
InputExpectedGot
[4,[[0,1],[0,2],[1,3],[2,3]],0,3]2not run yetsample