Give you an undirected graph to find the minimum cut output cut edge
The key to running the maximum flow is how to output the cut edges. The minimum cut actually removes some edges from a graph and divides it into two sets. The source node is in a set and the sink node is in a set. The edge connected between the sets is used from the source point to BFS to find all the points that are in a set with the source point (that is, the points that BFS can pass through). No, after finding the set, output all the edges with negative traffic (that is, change the traffic passing through) At the same time, one of the two points of the edge is in the set where the source point is located, and the other is not in the set where the source point is located. If the conditions are met, output