a.lin
于 2015-01-06 发布
文件大小:2KB
0 155
下载积分: 1
下载次数: 2
代码说明:
Dinic method of maximum flow construction, for O(n^3), using pseudo-maximal flow construction by Malhotra - Kumar - Maheshvari. By Vitold Lipsky ( Combinatorics for programmers , 1988). Written by: Amir Tulegenov, 2009
下载说明:请别用迅雷下载,失败请重下,重下不扣分!
发表评论