top | item 40070854 (no title) eutectic | 1 year ago Also, the problem is to find a global min-cut, which requires all-pairs max flow. discuss order hn newest gloria_mundi|1 year ago 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.
gloria_mundi|1 year ago 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.
gloria_mundi|1 year ago