Minimum Cut
Time Limit: 10000MS | Memory Limit: 65536K | |
Total Submissions: 9996 | Accepted: 4177 | |
Case 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. how many ed