Edge-disjoint paths
A directed network on n nodes (0..n-1) is given by a list of directed links [u, v] (each carries one unit). Return the maximum number of edge-disjoint directed paths from s to t (paths that share no link). Parallel links between the same pair each count separately. Constraints: 1 <= n <= 500.
Implement
max_edge_disjoint_paths(n: int, edges: list[list[int]], s: int, t: int) → intExamples
in
[4,[[0,1],[0,2],[1,3],[2,3],[1,2]],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],[1,2]],0,3]2not run yetsample