(g, a)
| 142 | return min_cut |
| 143 | |
| 144 | def minimum_cut(g, a): |
| 145 | min_cut = sum(w for v, w in g.adjacents(a)) |
| 146 | while len(g.vertices) > 1: |
| 147 | min_cut_candidate = min_cut_phase(g, a) |
| 148 | if min_cut_candidate < min_cut: |
| 149 | min_cut = min_cut_candidate |
| 150 | return min_cut |
| 151 | |
| 152 | |
| 153 | class Reader(object): |
no test coverage detected