Description: 本文用Ｃ语言实现了优化算法－最小费用最大流算法，主要用于图论领域-Using C programming language, the optimization algorithm-minimum cost maximum flow algorithm, mainly for the field of graph theory Platform: |
Size: 2925 |
Author:申辉 |
Hits:
Description: implementation of Edmonds algorithm for computing a minimum cost perfect matching in a graph
Version 1.0 Platform: |
Size: 43789 |
Author:zhangqian |
Hits:
Description: 本文用Ｃ语言实现了优化算法－最小费用最大流算法，主要用于图论领域-Using C programming language, the optimization algorithm-minimum cost maximum flow algorithm, mainly for the field of graph theory Platform: |
Size: 3072 |
Author:申辉 |
Hits:
Description: 在连通的带无权无向图中寻找一个最小
代价生成树的程序。-In the connected undirected graph with no right to seek a minimum cost spanning tree procedure. Platform: |
Size: 1024 |
Author:zyz |
Hits:
Description: 解决图论中Warshall-Floyd 算法，Kruskal 避圈法，匈牙利算法，求最佳匹配的算法，求最大流的Ford--Fulkerson 标号算法，求解最小费用流问题的matlab程序-Solve the graph theory Warshall-Floyd algorithm, Kruskal avoid lap law, Hungary algorithm, and the best matching algorithm, for maximum flow of the Ford- Fulkerson labeling algorithm for solving the minimum cost flow problem of matlab procedures Platform: |
Size: 47104 |
Author:yangfei |
Hits:
Description: 使用集合命令编写的图论最短路dijkstra算法的matlab程序，flord算法的matlab程序，最大匹配的匈牙利算法（hungary）matlab程序，最小生成树的两种方法编写的matlab程序，最小费用最大流matlab程序-Prepared in order to use a collection of graph theory Dijkstra shortest path algorithm matlab program, flord algorithm matlab procedures, the maximum matching algorithm Hungary (hungary) matlab procedures, minimum spanning tree, prepared by two methods matlab procedures, the minimum cost maximum flow matlab program Platform: |
Size: 5120 |
Author:任龙 |
Hits:
Description: 输入无向图的邻接矩阵，使用前面讲过的任意三种方法求该图的最小代价生成树，并分析各自的时间复杂度。-Enter the undirected graph of adjacency matrix, said in front of the arbitrary use of three methods for the minimum cost spanning tree graph, and analyze their time complexity. Platform: |
Size: 3072 |
Author:张建鑫 |
Hits:
Description: implementation of Edmonds algorithm for computing a minimum cost perfect matching in a graph
Version 1.0 Platform: |
Size: 44032 |
Author:zhangqian |
Hits:
Description: 本人参加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 minimum cost maximum flow, etc., it can be said of very strong combat. Platform: |
Size: 14336 |
Author:诗苇 |
Hits:
Description: 在图形中若于个边(edge)上加上一些值，此数值称为比重( weight ) 。而此图形称为比重图形(Weight Graph ) ，若weight是成本( cost )或距离( distance ) ，则称此图形为网路( Network )。根据Spanning Tree的定义，知一个图形可有许多不同spanning tree ，在network中找出一个具有最小成本( Cost )的Spanning tree ，则此Spanning tree称为最小成本生成树。-If in the graph in a side (edge) to add some value, this value as the proportion (weight). This graph is called the proportion of graphics (Weight Graph), if the weight is the cost (cost) or distance (distance), said the graphics for the network (Network). Spanning Tree in accordance with the definition of a graph to know there are many different spanning tree, in the network to find a minimum cost (Cost) of the Spanning tree, then the minimum cost Spanning tree known as the spanning tree.
Platform: |
Size: 3072 |
Author:lll |
Hits:
Description: 已知一以动态存储结构形式存储的，以邻接多重表表示的无向图。请用KRUSKAL算法求出它的最小代价生成树。-Storage structure known to form a dynamic storage to multiple tables that non-adjacent to the graph. Please KRUSKAL algorithm solves the minimum cost spanning tree. Platform: |
Size: 3072 |
Author:ray |
Hits:
Description: 多段图G=(V,E)是一个有向图。它具有如下特征：图中的节点被划分成k>=2个不相交的集合Vi，1<=i<=k,其中V1 与Vk 分别只有一个结点s（源点）和t（汇点）。图中所有的边<u,v> 均具有如下性质：若 ，则 ，1<=i<k-1,且每条边<u,v>均附有成本c<u,v>。从s到t的一条路径成本是这条路径上边的成本和。多段图问题是求s到t的最小成本路径。每个集合 定义图中的一段。由于E得约束，每条从s到t的路径都是从第1段开始，在第k段终止。-Multi-stage graph G = (V, E) is a directed graph. It has the following characteristics: graph node is divided into k> = 2 disjoint sets Vi, 1 < = i < = k, where V1 and Vk are only one node s (source) and t (Meeting Point ). Figure in all of the edges <u,v> All have the following property: If, then, 1 < = i <k-1,且每条边<u,v> Comes with costs c <u,v> . From s to t, the cost of a path is the path on top of costs and. Multistage Graph Problem is seeking a minimum cost s to t path. Defined by a set figure for each section. Since E was bound, and each path from s to t are from the beginning of paragraph 1, paragraph k in the first end. Platform: |
Size: 2048 |
Author:jory |
Hits:
Description: This question was asked in IEEE Extreme Programming 2010. Its a graph problem, that the nodes with minimum cost should be followed. Platform: |
Size: 1024 |
Author:Molinken |
Hits:
Description: Kruskal算法和Prim算法
任何只由G的边构成,并包含G的所有顶点的树称为G的生成树(G连通).
加权无向图G的生成树的代价是该生成树的所有边的代码(权)的和.
最小代价生成树是其所有生成树中代价最小的生成树.-Kruskal algorithm and Prim algorithm
Any edge of only by G, is composed of all the vertices containing G tree called G of the spanning tree (G connected).
The weighted no directed graph G is the price of spanning tree all the spanning tree right on the edge of the code () and.
The lowest cost spanning tree is in all its spanning tree minimum cost of the spanning tree. Platform: |
Size: 1024 |
Author:江洋 |
Hits:
Description: 编程实现Kruskal算法，生成最小代价生成树，其中利用最小堆算法实现。
（随机生成n个点，且随机生成k条边，形成连通图）
根据输入的顶点数的不同，分析时间复杂度。-Implement Kruskal’s algorithm based on min-heap and disjoint set data structure for constructing a minimum cost spanning tree.
Generate weighted undirected complete graph for given size n according to the following approach:
1) Randomly generate n points (x,y) on a plane
2) Randomly generate k pairs of points as edges of the graph.
3) The weight of an edge of the graph is defined as the the Euclidean distance between two endpoints of the edge.
Platform: |
Size: 2048 |
Author:许许 |
Hits:
Description: 数据结构实验六图的操作，在程序中提示输入的顶点数以及每两条边之间的权值，最后使用深度优先和广度优先算法实现遍历，同时构建最小耗费生成树的最小权值和路径。-Experimental data structure diagram of the operation of six, in the program prompts for the number of vertices and edges between every two weights, the final depth-first and breadth-first traversal algorithm, while the minimum cost to build the minimum spanning tree and path weights . Platform: |
Size: 1214464 |
Author:敏敏特穆尔 |
Hits:
Description: 图论算法及MATLAB程序代码,包含算法pdf文档和M文件。Warshall-Floyad算法，Kruskal避圈法，匈牙利算法，可行点标记求最佳匹配算法，Ford--Fulkerson标号法求最大流算法，最小费用最大流算法。求解数学模型必备！-Graph theory algorithms and MATLAB code contains of algorithm pdf documents and M files. The the Warshall-Floyad algorithm, Kruskal avoid lap law, Hungary algorithm feasible point mark for the best matching algorithm, Ford- Fulkerson labeling method for maximum flow algorithm, minimum cost maximum flow algorithm. To solve the mathematical model is essential! Platform: |
Size: 207872 |
Author:Binjie Liao |
Hits:
Description: 设计、实现一个全国大城市间的交通咨询程序，为旅客提供三种最优决策方案：（1）时间最短（2）费用最小（3）中转次数最少。-Design, implement a nationwide consultation process traffic between major cities to provide passengers with three kinds of optimal decision scenarios: (1) the shortest time (2) minimum cost (3) minimum number of transit. Platform: |
Size: 2048 |
Author:xysmlx |
Hits:
Description: 在一个具有几个顶点的连通图G中，如果存在子图G 包含G中所有顶点和一部分边，且不形成回路，则称G 为图G的生成树，代价最小生成树则称为最小生成树。 -Has several vertices in a connected graph G, if there subgraph G ' contains all vertices of G and part of the side, and does not form a loop, called G' is a spanning tree of G, the minimum cost spanning tree is called minimum spanning tree. Platform: |
Size: 1024 |
Author:刘适 |
Hits:
Search - minimum cost graph