标签 - 全局最小割

? 解题记录 ? ? POJ ? ? 全局最小割 ?    2017-08-16 10:23:00    310    0    0
Minimum CutTime Limit: 10000MS Memory Limit: 65536KTotal Submissions: 10078 Accepted: 4208Case Time Limit: 5000MS Description Given an undirected graph, in which two vertices can be connected by multiple edges, what is the size of the minimum cut of the graph? i.e.