搜索资源列表
GraphTheoryAlgorithmMATLAB
- 图论算法及其MATLAB 程序代码 1.求赋权图G = (V, E , F )中任意两点间的最短路的Warshall-Floyd 算法、Kruskal 避圈法 2.求二部图G 的最大匹配的算法(匈牙利算法)、利用可行点标记求最佳匹配的算法 3.从一个可行流f 开始, 求最大流的Ford--Fulkerson 标号算法 6.-Graph Theory Algorithm and MATLAB program code 1. Seeking weighted graph G = (V
tulun
- 图论的各种算法，包括最短路 最大流等，代码都在里面-A variety of graph theory algorithm code on the inside
max_flow
- 通用的计算最大流程序，算法的思想比较简单，对初学者编程有参考意义-Generic maximum flow calculation procedure is relatively simple algorithm, for beginners programming reference value
minmax
- 最小费用最大流问题,是用C实现的，比较高效率-Minimum cost maximum flow problem is to use C to achieve relatively high efficiency
8_7
- 计算机算法试题库问题，用最大流实现，运行正确-Computer algorithms questions Treasury issues, with the realization of maximum flow, operating correctly
maxflowandmincut
- 最大流最小分割算法的实现。maxflow -Maximum flow minimum partition algorithm. maxflow
15km
- 模拟具有环形岛的十字路口的交通流，可以仿真出的到该路口的最大通行能力。-Simulation with circular island at the crossroads of the traffic flow can be simulation out to the junction, the largest capacity.
maximum_flow
- 最大流程序,在这个函数的编制中存在一个细节，当任取一个已标号未检查的点的时候，我取的最靠前的点。如果加进随机选取的语句，每次运行程序可能会出现不同的最大流结果。-Maximum flow procedures
dianliuyuan
- 用89C52制作恒流源，精度可达1mA.最大可以达到1A，可进行递增或递减控制，步进为10.-89C52 produced by constant current source, the accuracy of up to 1mA. The largest can reach 1A, can be increased or reduced control, stepper for 10.
maxflow-v3.0.src.tar
- 图像处理最大流最小割经典算法,适合初学者使用！-A classic max flow/min cut algorithm in image processing
network_flow
- 最大流算法,对于给定的有向图，计算出该图上的最大流-Maximum flow algorithm, for a given directed graph is calculated on the graph of maximum flow
Dinic
- dinic算法 相当实用，ACM最大流必备-useful dinic algorithm, ACM maximum flow must
data_structure
- 1.表达式求值；2.二分匹配模板；3.最大流；4.点到线段的距离；5.字符串字典顺序-1. Expression evaluation 2. Two sub-matching template 3. Maximum flow 4. Points to the distance segment 5. String dictionary order
DinicAndSAP
- 求最大流的Dinic和SAP算法的实现，各自有递归与非递归版本。在稀疏图上效果比较好。-Dinic for the maximum flow algorithm and the SAP implementation, each of which has recursive and non-recursive version. Effect on the sparse map is better.
Dinic
- Dinic求最大流, Dinic求最大流, Dinic求最大流,Dinic求最大流-Dinic for maximum flow, Dinic for maximum flow, Dinic for maximum flow, Dinic for maximum flow, Dinic for maximum flow, Dinic for maximum flow
graph_cut
- 最大流最小割的代码，功能很好很强大，可以用在图形剪除这方面。-Maximum flow minimum cut of the code, very very powerful feature can be used to cut off this area in the graphics.
HDOJ1532_MAXFLOW
- hdoj 1532 最大流 edmonds_karp算法-hdoj 1532 maximum flow algorithm edmonds_karp
POJsolution090504
- poj 北大oj 90到算法题源码 二分匹配 最大流 简单 dp 搜索 等-poj solution sorcefile
maxflow-v3.0
- 最大流或最小割问题的算法实现，采用graph cut方法做图像分割时需要用到最小割。-Maximum flow or minimum cut algorithm problem, the graph cut image segmentation methods need to use minimum cut.
Maximumflow
- 在这个函数的编制中存在一个细节，当任取一个已标号未检查的点的时候，我取的最靠前的点。如果加进随机选取的语句，每次运行程序可能会出现不同的最大流结果。-In this function, there is a compilation of details, when the term of office does not take a grade-point inspection, I take the point of the most high. If the added words were