搜索资源列表
maxflow.rar
- 图论中最大流问题的matlab实现代码，求给定网络最大流,Maximum flow problem in graph theory implementation of matlab code, seeking maximum flow in a given network
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.
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
MaxFlow_PushRelabeledAlgorithm
- Push&Relabeled algorithm to find the optamal flow on the graph
200756135454786
- matlab 图论 中所有程序 求最短路。。最小生成树。。网络最大流等-matlab graph theory for the short-circuit all the procedures. . Minimum spanning tree. . Network, such as maximum flow. . .
graph
- 现实生活中有很多关于流量的问题，比如说公路系统的车辆流，供水系统的水流，金融系统的金流等等。为了解决这些关于流量的问题，我们需要学习一系列关于流量的算法。-In real life there are many issues on the flow, such as road traffic flow system, water supply system, financial system, cash flow and so on. In order to solve these issues
follow
- 资料介绍了图论算法中最重要的定理之一的最小个最大流定理-Information on the graph theory algorithm, one of the most important theorem of the minimum of maximum flow theorem
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
tg
- Report on the theory of graph differ from the shortest path algorithm and flow.
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
maxflow
- Yuri Boykov s and Vladimir Kolmogorov s work on graph cuts and MRF optimization has been extensively cited in the academia, and their maximum flow implementation is widely used in computer vision and image processing research.
Bipartite-graph-matching-template
- 求二分图匹配多种算法，网络流最大流的部分模板-Find a variety of bipartite graph matching algorithms, network flow part of the template maximum flow
MaxFlow
- 最大流最小割 可以测试某一个特定的图 也可以随机生成n个顶点的图和k条边 用来分析时间复杂度-Maximum flow minimum cut to test a particular map can also be randomly generated graph of n vertices and k edges used to analyze the time complexity
connectivity
- 使用C++实现的一个计算图的连通度的程序 该算法使用Edmonds-Karp算法，基于网络流的计算而成。-this program is implemented by c++ and it is for the calculation of Graph Connectivity Degree,it uses Edmonds-Karp algorithm,which is famous for calculating network flow.
Graph-theory-algorithm-set
- 对matlab解决图论问题的算法做个汇总。主要包括：顶点覆盖近似算法、哈密尔顿回路、最大流和最小截、最短路和次短路、最小生成树Prim算法、最短路径等等。由于太多就不一一列举了。-Matlab to solve the problem of graph theory algorithms to be aggregated. Include: vertex cover approximation algorithm, Hamilton circuit, the maximum flow and m
FordFulkerson
- 有向图中求最大流的一种方法：feasible_match求最大流-Directed graph and maximum flow of a kind of methods: feasible_match for maximum flow
graph
- 数据结构Java版图的实验，作业，大学 数据结构作业 图的实现-Java map data structure experiment, assignments, university of the realization of the data structure flow chart
Graph-algorithm-and-Matlab-program
- 求单源最短路径的Dijkstra算法的Matlab程序 求Euler回路的Fleury算法的Matlab程序 求最小生成树的Prim算法的Matlab程序 求Huffman树的Matlab程序 最大流算法Matlab程序 求任意两点间最短路的Floyd算法的Matlab程序 -Seeking single-source shortest path Dijkstra algorithm Matlab program Euler circuit Fleury seekin
network-graph-CPP-cometrue
- 最大流增广路算法的实现，本代码使用C++实现了最大流增广路算法-max-flow augmenting path algorithm cometure using C++.