搜索资源列表
graphDegree
- 求图的顶点连通度算法。方法就是先对源和汇做枚举，之后对每个枚举情况，把除去源汇两点的其余所有顶点看成是容量限制为1的点，求网络的最大流，就是此点对的顶点连通度，之后对枚举的所有点对找连通度最小的当成图的连通度。 带有顶点容量限制的最大流方法：将带容量限制的顶点u拆成两个点u 和u*，原顶点u的入边为u 的入边，原顶点u的出边为u*的出边，之后在u 和u*之间连接双向边，边的容量为顶点的容量限制。-plans for the vertex connectivity algorithms. F
matlog
- 物流分析工具包。Facility location: Continuous minisum facility location, alternate location-allocation (ALA) procedure, discrete uncapacitated facility location Vehicle routing: VRP, VRP with time windows, traveling salesman problem (TSP) Networks: Sho
求网络的最小费用最大流网络版
- 求网络的最小费用最大流网络版-for the minimum cost network flow largest online edition
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
flowofdistribution33nodes
- 此程序为MATLAB实现的配电网33节点潮流计算，方法为前推回代法。-MATLAB realization of this program for the distribution network 33 nodes in power flow calculation, and methods for the former to push back on behalf of the law.
ConstantiniUnwrap
- InSAR里面的最小网络流法相位解缠绕的MATLAB源代码，绝对能够运行。-InSAR which the minimum network flow phase unwrapping method for MATLAB source code is absolutely able to run.
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
caoliu
- PQ分解法潮流计算程序。既可以用于高压输电网的潮流解算，又可以用于低压配电网的潮流解算，还可以同时解算输电网 加配电网的混合潮流问题。-PQ decomposition process flow calculation. Both high-voltage transmission networks can be used to calculate the trend, but also can be used in the trend of low voltage distribution
Graph_Theory
- 图论模型及方法 搞计算机算法和数学建模的人都知道图论是一个很重要的内容。本资料介绍了图论中的最短路算法、匹配、邮递员和货郎问题、最小生成树、网络流等经典问题。而且有非常经典易懂的Matlab程序。-Graph theory and methodology of engaging in computer algorithms and mathematical modeling of the people know that graph theory is a very important cont
GACFA
- 使用遗传算法求解通信网链路容量和流量联合优化分配问题!-Communications network using genetic algorithm for solving the joint optimization of link capacity and flow allocation problem!
flow
- 上下界的最大最小流合成模板 高效率算法 网络流-Bounds of the maximum and minimum flow of synthetic template efficient network flow algorithm
power-flow
- 基于内点法的配电网潮流计算，收敛精度同牛顿二阶法，不同之处在于它可以处理大规模潮流计算，而牛顿法不行。-power flow of distributiion network
Detailed-algorithm-for-maximum-flow
- 在网络流中如何求解最大流的算法，以及网络流中的一些定理-How to solve the network flow algorithm for maximum flow, as well as some theorems in network flow
980507(Network-flow-IPII)
- 演算法程式設計課堂練習檔，本檔為visual studio之c/c++專案資料夾壓縮檔，內容為network flow之練習題-the practicing file of the computer algorithm course
Graphical-tree-network-flow
- 采用MATLAB实现图形化树状网潮流计算程序开发-Graphical tree network flow calculation program development
ultimate-solution-of-network-flow
- 网络流终极解包裹程序，自动绕过包裹相位图的残差点，得到好的解包裹结果。-The ultimate solution of network flow wrapping other programs to automatically bypass the wrapped phase map of the residual was almost good unwrapping results.
max-flow
- 最大网络流模板 EK算法 uva Internet Bandwidth 解答-The maximum network flow algorithm uva Internet Bandwidth template EK answers
load flow for network
- hi to all. in this program use matlab m-file for solve load flow in network
NEW LOAD FLOW
- new method of load flow for radial network