Not actually all-pairs max flow, you can fix the source and consider all possibl...

gloria_mundi 6 months ago | parent | context | favorite | on: Solving the minimum cut problem for undirected gra...

Not actually all-pairs max flow, you can fix the source and consider all possible sinks. In the AoC problem we also know that the min-cut is 3, so we can abort the flow algorithm as soon as we have found a 4-flow.