搜索资源列表
MinFareMaxFlux
- 计算最小路径最大流的程序，计算效果很好，小费大流-To calculate the minimum path maximum flow program
1
- 通过matlab程序实现最小费用最大流算法，获取最多的经济效益-By matlab program for minimum cost maximum flow algorithm, get the most cost-effective
Bipartite-graph-matching-template
- 求二分图匹配多种算法，网络流最大流的部分模板-Find a variety of bipartite graph matching algorithms, network flow part of the template maximum flow
Bipartite-graph-matching-problem)
- 关于二分图中一些定义，定理及如何求解最大流的问题-Bipartite graph on some definitions, theorems and how to solve the problem of maximum flow
Detailed-algorithm-for-maximum-flow
- 在网络流中如何求解最大流的算法，以及网络流中的一些定理-How to solve the network flow algorithm for maximum flow, as well as some theorems in network flow
cc
- 有关最大流问题的详细描述及其解决，希望能对大家有所帮助。-For a detailed descr iption of maximum flow problems and their solutions, hoping to help.
cc
- 经典图论，其中叙述了图论的经典算法等，如最大流、最小割等相关算法。-Classical graph theory, graph theory, which describes the classical algorithms, such as maximum flow, minimum cut, and other related algorithms.
1163
- 最大流算法，差分约束系统， 最大流算法，差分约束系统， 最大流算法，差分约束系统，的代码实现-the algorithm of maxflow askfasfka alskdfja aldfjas askdjfa askdlfjad askdf askfj askdfj askfjaf
Flow-statics
- 自己写的一个流量统计系统，运行平台是linux，可以统计出数据包包长分布，进出流量，某个时间段流量，最大流Top5，以及基于IP地址的统计等-Write a traffic statistical systems, operating platform is linux, you can bag length distribution statistics of data, and out of traffic, a time flow, maximum flow Top5, and IP-ba
MaxFlow
- 最大流最小割 可以测试某一个特定的图 也可以随机生成n个顶点的图和k条边 用来分析时间复杂度-Maximum flow minimum cut to test a particular map can also be randomly generated graph of n vertices and k edges used to analyze the time complexity
network
- 算网络的最大流，通过该算法可以计算一个网络是否达到了最大流，以及时候还存在增广路径-compute the max of a network
minimum-cost-maximum-flow
- 用于求解网络的最小费用最大流问题，求一个网络中的最大流-Network for solving the minimum cost maximum flow problem, find the maximum flow in a network
netflow
- 最高标号预流推进算法模板，速度最快的求解最大流算法-Maximum label template pre-flow push algorithm, the fastest algorithm for solving maximum flow
dgc
- 动态的基于图模型的图像分割算法 ，利用最大流最小波-DYNNAMIC GRAPH CUTS- software for dynamically computing mincut/maxflow in a graph
fafu1198
- FAFU（福建农林大学）1198小三大作战的题解，用的是最大流EK算法。-FAFU (Fujian Agriculture and Forestry University) 1198 small three operations problem solution, using a maximum flow EK algorithm.
regionpushrelabel-v1.01
- 适用于大型网格图的最大流最小割算法，适合初学者-The regionpushrelabel-v1.03 library computes max-flow/min-cut on huge N-dimensional grid-graphs in graphics, vision, and medical imaging. The C++ implementation is designed specifically for multi-core systems and graphs larger
maximum-flow
- 运筹学中的最大流与最小载问题求解matlab源程序-Operations Research in the maximum flow and minimum load problem solving matlab source code
Bittracker
- 一篇用最大流算法实现位跟踪的文章，扩展了最大流的应用-A bit with a maximum flow algorithm to track the article extends the application of maximum flow
fofuf
- ford-fulkerson算法，通过标号寻找网络最大流-ford-fulkerson algorithm
MaxFlowMinCut_Me
- 利用Ford--Fulkerson 标号法求最大流算法的MATLAB 程序代码-The use of Ford- Fulkerson labeling method for the maximum flow algorithm of MATLAB code