Local edge connectivity
A network is modeled as an undirected graph on n nodes (0..n-1) given by an edge list (each edge is a bidirectional link of capacity 1). Return the local edge connectivity between s and t: the minimum number of links you must cut to disconnect s from t. By Menger's theorem this also equals the maximum number of edge-disjoint s-t paths. Constraints: 1 <= n <= 300; edges may include parallel links.
Implement
edge_connectivity_st(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 40 min
solution.py
InputExpectedGot
[4,[[0,1],[0,2],[1,3],[2,3],[1,2]],0,3]2not run yetsample