Most powerful closed sub-graph

Reference Blog: https://www.cnblogs.com/dilthey/p/7565206.html

What is the maximum weight closure sub-graph?

Give you a figure (the number indicates the point right)

Let you in one of the selected points (choose to follow it to select the point), so that the weight of the largest, ask the election method.

The most powerful closed sub-figure is 7 +-1 = 3

How to solve?

We can solve with minimum cut.

We take the S-to-right point with a capacity as a weighted edge, and a negative weight point to an edge with the absolute value of the weight.

At the same time, the original Benquan changed to INF, the minimum cut.

The most powerful closed sub-graph is the S graph, the maximum is the positive weight point and-min cut

Most powerful closed sub-graph