搜索资源列表
-
0下载:
最小费用最大流问题,是用C实现的,比较高效率-Minimum cost maximum flow problem is to use C to achieve relatively high efficiency
-
-
0下载:
最大流或最小割问题的算法实现,采用graph cut方法做图像分割时需要用到最小割。-Maximum flow or minimum cut algorithm problem, the graph cut image segmentation methods need to use minimum cut.
-
-
0下载:
关于最大流问题,与最大匹配的讲解。内容比较浅显易懂。-On the maximum flow problem, with the largest matching explained. The study were easy to understand.
-
-
0下载:
关于二分图中一些定义,定理及如何求解最大流的问题-Bipartite graph on some definitions, theorems and how to solve the problem of maximum flow
-