Question
You are given a directed flow network with n nodes (0..n-1) and edges [u, v, c] where c is a non-negative integer capacity. Compute the maximum flow from a given source to a given sink. Multiple edges between the same pair of nodes add their capacities. Constraints: 1 <= n <= 200; capacities fit in 32-bit integers; source != sink is guaranteed only when a non-trivial answer is expected.
max_flow(n: int, edges: list[list[int]], source: int, sink: int) → int[4,[[0,1,3],[0,2,2],[1,2,1],[1,3,2],[2,3,3]],0,3]out5State 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.
Vibe coding: describe the solution in plain language (or narrate it) and the coach grades your approach. Generating runnable code from your description is coming next.