搜索资源列表
graphDegree
- 求图的顶点连通度算法。方法就是先对源和汇做枚举，之后对每个枚举情况，把除去源汇两点的其余所有顶点看成是容量限制为1的点，求网络的最大流，就是此点对的顶点连通度，之后对枚举的所有点对找连通度最小的当成图的连通度。 带有顶点容量限制的最大流方法：将带容量限制的顶点u拆成两个点u 和u*，原顶点u的入边为u 的入边，原顶点u的出边为u*的出边，之后在u 和u*之间连接双向边，边的容量为顶点的容量限制。-plans for the vertex connectivity algorithms. F
ACM_template.rar
- 本人参加ACM竞赛使用的一些算法模板，包括二分图匹配，欧拉回路的构造以及网络流中的最大流与最小费用最大流等，可以说实战性非常强。,ACM competitions I take part in a number of algorithms used in templates, including two sub-graph matching, Euler circuit, as well as network flow structure of the maximum flow and mini
graph
- 图论的算法，最短路，最小生成树，连通，匹配，网络流及应用。-Graph theory, algorithms, shortest path, minimum spanning tree, connectivity, matching, network flow and applications.
netflow
- 网络流算法的程序以及用网络流解决两个最小割模型的代码-Network flow algorithm for the procedure as well as network flow solution to the two minimal cut model code
zuiduanlujingwangluoliu
- 最短路径与网络流 讲解最短路径与网络流的算法及其实现-The shortest path and network flow on the shortest path and network flow algorithm and its implementation
netwokflow
- 网络流算法介绍与分析，提出了一种新型算法并进行了分析！可作为学习的资料来用！-Descr iption and analysis of network flow algorithm, a new algorithm and analyzed! As learning materials to use!
graphy_theory
- 关于图论的一些算法和应用。 网络流、上下界网络流、km最佳匹配，弦图判定，一般图最大匹配，有向图最小生成树。-Some on the graph theory algorithms and applications. Network flows, network flow bounds, km best match the string diagram as to the general graph maximum matching, minimum spanning tree directed
networkflow
- 网络流算法的ppt，简洁易懂，是杭州学军中学 魏越闽的ppt -Network flow algorithm ppt, simple and easy to understand, is more of Hangzhou Xuejun High School Wei Min ppt
basic-algo.pdf
- ACM常用算法与数据结构，如平衡树，线段树，各种网络流算法。-ACM commonly used algorithms and data structures, such as the balanced tree, segment tree, a variety of network flow algorithms.
Dijkstra(cPP)
- Dijkstr数值算法，求解网络流的最短路径算法-Dijkstr numerical algorithm for solving the shortest path algorithm for network flow
Bipartite-graph-matching-template
- 求二分图匹配多种算法，网络流最大流的部分模板-Find a variety of bipartite graph matching algorithms, network flow part of the template maximum flow
zoj2314
- zoj2314的解题源代码，属于求有上下界网络流的题目。内有核心代码的解析-zoj2314 problem-solving source code, is seeking a network flow bounds of the subject. Resolution within the core code
980507(Network-flow-IPII)
- 演算法程式設計課堂練習檔，本檔為visual studio之c/c++專案資料夾壓縮檔，內容為network flow之練習題-the practicing file of the computer algorithm course
cpp
- 包括一类经过优化的网络流算法实现，和poj的几道杂题的代码解答-Including a class of optimized network flow algorithm, and a few miscellaneous poj the code to answer questions
poj1273
- 网络流的压入与重标记算法，该代码以poj1273为例，比网上已有的更为简洁。-Network flow pressure in and re-labeling algorithm, the code example to poj1273 than the online already more concise.
wll
- 网络流算法，自己写的实现最大流问题的好方法，是用邻接表实现的ISAP，网上可是很少的哟-Network flow algorithm, a good way to write your own to achieve the maximum flow problem, is the ISAP adjacency list online but few yo
Pku_ACM_Training
- 北京大学ACM的培训资料还有相关题目的源代码。 里面涉及：组合数学、搜索、动态规划、图论、计算几何以及网络流的相关讲义及习题源代码。-Training materials as well as related topics of the Peking University ACM source code. Which involves: a combination of mathematics, search, dynamic programming, graph theory, compu
networkflow
- 网络流算法acm，需要了解残留网络和流等基础。-the acm network flow algorithm
lab-2
- 汽车加油行驶问题。线性规划与网络流24题之一，44ms过OJ。具有一定的参考性。-Car refueling traveling. Linear programming and network flow to one of the 24 questions, 44ms Accpted at OJ. Reference.
EK
- 图论---数据结构---算法，网络流中求最大流的经典算法，EK算法。-Graph Theory--- Data Structures--- algorithms, network flow for maximum flow of the classical algorithm, EK algorithms.