Smallest Minimum Cut(HDU 6214 dinic模板)
Consider a network G=(V,E) with source s and sink t. An s-t cut is a partition of nodes set V into two parts such that s and t belong to different parts. The cut set is the subset of E with all edges connecting nodes in different parts. A minimum cut is th
原创
2017-09-19 19:45:57 ·
583 阅读 ·
0 评论