搜索资源列表
求网络中的最大流.rar
- 数据结构的课后练习
graphDegree
- 求图的顶点连通度算法。方法就是先对源和汇做枚举,之后对每个枚举情况,把除去源汇两点的其余所有顶点看成是容量限制为1的点,求网络的最大流,就是此点对的顶点连通度,之后对枚举的所有点对找连通度最小的当成图的连通度。 带有顶点容量限制的最大流方法:将带容量限制的顶点u拆成两个点u 和u*,原顶点u的入边为u 的入边,原顶点u的出边为u*的出边,之后在u 和u*之间连接双向边,边的容量为顶点的容量限制。-plans for the ver
Least_cost_with_greatest_flow
- 题目:求网络的最小费用最大流-C语言 已经经过调试,没有问题!-topics : finding the minimum cost maximum flow-through C language has been tested and no problems!
zxfy_zdl
- 用Floyd算法设计的最小费用最大流,求最大流时,用的是标号算法-Floyd algorithm design with the minimum cost maximum flow, for maximum flow, the algorithm is labeling
graphcut
- 在计算机视觉中的立体匹配算法----最大流最小割,最新的研究成果.-in computer vision of the stereo matching algorithm-largest flow minimum cut, the latest research results.
NetStream
- 已知一个网络对应的邻接矩阵,求该网络上的最大流。属于数据结构中的问题。-a network known counterparts in the adjacent matrix, the network for the maximum flow. Data structures belonging to the problem.
wangluodezuixiaofeiyongdezuidaliu
- 这是一个求网络最小费用最大流问题的一个C++的程序已经经过调试,请放心使用.-This is a minimum cost network for the largest flow of a C procedures after debugging, please rest assured that use.
1149
- poj 1149 pigs 最大流的例题 还要写什么-poj 1,149 pigs maximum flow of excellence he wrote.
MaxStream
- 学习VC的时候写的,求解有向图的最大流和最小截集。-learning to write when the solution is to map the maximum flow and minimum cut-set.
zudlu
- 人工智能最大流算法 源码及设计文档,内含4个源代码-artificial intelligence maximum flow algorithm source code and design documents, containing four source code
MaxFlowDemo
- 在加权的有向图中,可以求出最大流路径,即求出从起点到终点权值之和最大的路径。
zuidaliusuanfa
- 最大流问题的算法,思路清晰,很值得收藏。大家赶快下载
stream
- 网络流算法 涉及:数据结构(图论)、算法、ACM 分类有最大流、最小费用最大流、最小割-Network flow algorithm involving: data structures (graph theory), algorithm, ACM classification has maximum flow, minimum cost maximum flow, minimum cut
3_MinCut
- 一个经典的求解最大流最小割代码 VC++版本-A classical solution of maximum flow minimum cut code VC++ Version
Networkstreaming
- 网络流 最大流(最大流得修改,因为增量网络不对,是双向的。)-Network streaming maximum flow (maximum flow may be amended because incremental network wrong in both directions.)
GraphCut
- 介绍了图割的基本思想,包括最大流最小割算法,以及简单的图割实例-Introduced the basic idea of graph cuts, including the maximum flow minimum cut algorithm, and simple instances of graph cuts
max-flow-min-cut-theorem
- 初学最大流最小割的几个很有用的参考资料,详细介绍了它的应用,很有帮助哦!-Maximum flow minimum cut beginner several useful references, details of its application, very helpful Oh!
算法代码
- 常用最短路径,最大流算法,c#实现,几种最短路径算法都有涉猎(Shortest path algorithm)
数控恒压恒流电源
- 设计实现了人们对电源的需要,输出电压可在0~12V之间,输出电流最大1A,具有两种单独的模式:电流源模式,电压源模式(The design realizes people's need for power supply, the output voltage can be between 0 and 12V, the output current is up to 1A, with two separate modes: current