搜索资源列表
matlab
- floyd最短路算法&求网络的最小费用最大流&匈牙利算法&求网络的最小费用最大流-Floyd s short for network algorithm and the minimum cost flow and Hungary algorithm for the minimum cost and maximum flow network
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.
HDOJ1532_MAXFLOW
- hdoj 1532 最大流 edmonds_karp算法-hdoj 1532 maximum flow algorithm edmonds_karp
xq
- 图论中最短路算法，最小生成树，最大匹配与最佳匹配的算法，旅行商问题，求最大流的Ford--Fulkerson 标号算法-Shortest path graph algorithm, minimum spanning tree, the largest and best match matching algorithms, traveling salesman problem, maximum flow for the Ford- Fulkerson labeling algorithm
max_flow
- 介绍最大流算法的ppt，The Ford-Fulkerson Augmenting Path Algorithm，The Capacity Scaling Algorithm，The Goldberg-Tarjan Preflow Push Algorithm，-Introduction maximum flow algorithm ppt, The Ford-Fulkerson Augmenting Path Algorithm, The Capacity Scaling Algorithm,
matlabCode
- floyd最短路算法、dijkstra最短路算法、求网络的最小费用最大流-floyd shortest path algorithm, dijkstra shortest path algorithm, find the minimum cost maximum flow networks
The-biggest-circulation-in-program
- 最大流通用程序,适用于运筹学里的最大流算法，很实用，很好用-The biggest circulation in program
Algorithm
- 一些算法的简单实现，最大流最小割、B树、最大堆、最短路径等-Simple implementation of the algorithm, the maximum flow minimum cut tree B, the maximum heap shortest path
Algorithm
- 主要是算法源码包。 包含线段树（区间更新，单点更新），网络流（最大流） ， 树状数组，求欧拉回路，简单几何，简单自动机，以及Polya计数问题的入门程序。-The algorithm source package. Contains the segment tree (update interval, single-point update), network flow (maximum flow), BIT(binary index tree), Euler circuit, simple g
dell
- 最大流算法，简单易懂的算法，可作为初学者学习！-Maximum flow algorithm, a straightforward algorithm, as a beginner to learn!
Ford-Fulkerson-algorithm
- C语言编写的，用标号算法解决最大流问题，文件中有例子和结果，适合初学者学习使用。-Written in C language, with Ford-Fulkerson algorithm to solve the problem, a file with examples and results, suitable for beginners learning to use.
Edmonds.cpp.tar
- Edmonds算法，寻找网络最大流 算法流程: 在残余网络中, 通过广搜找到一条增广路 找出增广路上的最小权值的边 更新残余网络 直到找不到增广路为止 // 统计当前网络中汇点的流-Edmonds algorithm to find the maximum network flow algorithm process: in the residual network, through extensive search to find an augmenting path
maxflow-v3.02.src
- 图的最大流算法实现 构造图，寻找增光路径，求取图的最大流-Graph algorithms to achieve maximum flow
1087(A-Plug-for-UNIX)(SAPPGAPPBFS)
- poj1087,SAP+GAP+BFS，最快的基于增广路径的最大流算法-poj1087, SAP+GAP+BFS, the fastest maximum flow algorithm based on augmenting path
1087(A-Plug-for-UNIX)
- poj1087,最快的基于预流推进的最大流算法-poj1087, the fastest maximum flow algorithm based on pre-stream propulsion
maxflowmincut
- 基于图论的图像分割——最大流最小割算法。内含最大流最小割算法通用matlab程序。-Maximum flow minimum cut algorithm- based on graph theory image segmentation. Maximum flow minimum cut algorithm contains generic matlab program.
graph-theory-common-algorithms-
- 图论算法 包括生长树 迪杰斯特拉 最大流 佛洛依德算法-graph theory common algorithms
Graph_Theory_Code
- 使用C++ STL的图论编程的相关代码 包括几乎所有经典算法 如：最短路径算法，最大流算法，最小生成树等-Using the C++ STL programming graph theory relevant code Including almost all the classic algorithm Such as: the shortest path algorithm, the maximum flow algorithm, minimum spanning tree
Dinic
- 在图论中的网络流部分，使用Dinic算法求解网络中的最大流。(Can achieve maximum flow in graph theory)
pipei
- 求二分图最大匹配可以用最大流或者匈牙利算法。 最大匹配 给定一个二分图G，在G的一个子图M中，M的边集中的任意两条边都不依附于同一个顶点，则称M是一个匹配. 选择这样的边数最大的子集称为图的最大匹配问题 如果一个匹配中，图中的每个顶点都和图中某条边相关联，则称此匹配为完全匹配，也称作完备匹配。(For maximum matching of two partite graphs, maximum flow or Hungarian algorithm can be used. The maxim