POJ 2914 Minimum Cut 无向图最小割
摘要:
Minimum CutTime Limit:10000MSMemory Limit:65536KTotal Submissions:6869Accepted:2848Case Time Limit:5000MSDescriptionGiven 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 edges must be removed at least to d 阅读全文
posted @ 2013-09-07 15:56 电子幼体 阅读(189) 评论(0) 推荐(0) 编辑