Maximum vertex-disjoint paths
Given a directed graph with n nodes (0..n-1) and edges [u, v], find the maximum number of internally vertex-disjoint paths from a given source to a given sink: paths that share no intermediate vertex (they may share only the source and sink). Return that count. Constraints: 1 <= n <= 100.
Implement
max_vertex_disjoint_paths(n: int, edges: list[list[int]], src: int, dst: int) → intExamples
in
[4,[[0,1],[1,3],[0,2],[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 50 min
solution.py
InputExpectedGot
[4,[[0,1],[1,3],[0,2],[2,3]],0,3]2not run yetsample