Description: kruscal的源代码，实现最小生成树的算法，这个是本人自己编的小程序。-kruscal the source code to achieve the minimum spanning tree algorithm, this is my own small part of the process. Platform: |
Size: 1024 |
Author:涂奎 |
Hits:
Description: 最小生成树的kruskal算法,我的数据结构课程设计的源代码，很好用。-the Kruskal minimum spanning tree algorithm, the data structure of curriculum design source code, with very good. Platform: |
Size: 7168 |
Author:胡冰 |
Hits:
Description: Prim 算法寻找最小生成树，用C语言实现，有完整的注释！-Prim algorithm to find the minimum spanning tree, using C language, a complete Notes! Platform: |
Size: 1024 |
Author:gao |
Hits:
Description: 物流分析工具包。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: Shortest path, min cost network flow, minimum spanning tree problems
Geocoding: U.S. city or ZIP code to longitude and latitude, longitude and latitude to nearest city, Mercator projection plotting
Layout: Steepest descent pairwise interchange (SDPI) heuristic for QAP
Material handling: Equipment selection
General purpose: Linear programming using the revised simplex method, mixed-integer linear programming (MILP) branch and bound procedure
Data: U.S. cities with populations of at least 10,000, U.S. highway network (Oak Ridge National Highway Network), U.S. 3- and 5-digit ZIP codes -logistics analysis tool kit. Facility location : Continuous minisum facility location, alternate location-allocation (ALA) procedure, discrete uncapacitated Vehicle routing facility location : VRP, VRP with time windows, the traveling salesman problem (TSP) Networks : Shortest path, min cost network flow, minimum spanning tree Geocoding problems : world city or ZIP code to longitude and latitude, longitude and latitude to nearest city, Mercator projection plotting Layout : Steepest descent Pairwise interchange (Constituencies) heuristic for QAP Material handling : Equipment selection General purpose : Linear programming using the revised simplex method, mixed-integer linear programming programming (MILP) branch and bound procedure Data : world cities with populations of at least 10,000, U. Platform: |
Size: 4853760 |
Author:陈宝文 |
Hits:
Description: 最大流量Prim 算法寻找最小生成树,用C语言实现,有完整的注释-maximum flow Prim finding minimum spanning tree algorithm, using C language, a complete Notes Platform: |
Size: 1024 |
Author:DoDoggy |
Hits:
Description: 一段简单的代码，
使用C++实现模式识别中最小生成树的算法，
具体详见源代码-For some simple code, using C++ Realize pattern recognition in the minimum spanning tree algorithm, the specific details, see the source code Platform: |
Size: 3072 |
Author:JustSea |
Hits:
Description: 最小生成树的代码实现。运用kruskal算法实现。-Minimum spanning tree of the code. The use of Kruskal algorithm. Platform: |
Size: 729088 |
Author:ahkoo |
Hits:
Description: 自己编的，在VB中实现普里姆最小生成树算法的代码，有图的，边的权值是随机生成的，5个节点，点“generate tree”，就会显示出最小树。-Own, and in VB in the minimum spanning tree algorithm prim implementation code, there is graph, edge weights are randomly generated, five nodes, point " generate tree" , will show the most trees. Platform: |
Size: 2048 |
Author: |
Hits:
Description: 最小生成树Prim算法的matlab文件，无论是在数据结构还是在图论中都有广泛的应用-Prim minimum spanning tree algorithm matlab file, whether in data structures or graph theory, there are a wide range of applications Platform: |
Size: 1024 |
Author:小明 |
Hits:
Description: 这是一个关于数据结构中最小生成树的源代码，是课程作业。-This is data about the structure of a minimum spanning tree of the source code, programs are operating. Platform: |
Size: 226304 |
Author:catsic |
Hits:
Description: 图论部分的MPI源码，包括传递闭包、连通分量、最短路径和最小生成树，附带说明和测试用例-Graph Theory part of the MPI source code, including the transitive closure, connected components, shortest path and minimum spanning tree, with instructions and test cases Platform: |
Size: 738304 |
Author:不死鸟 |
Hits:
Description: 本压缩包完整地实现了最小可度限制生成树的算法程序，代码很完整。-The archive can be fully achieved the degree-constrained minimum spanning tree algorithm program, the code is very complete. Platform: |
Size: 2048 |
Author:榔头 |
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: 该源码为图的最小生成树的C++实现，在与图相关的问题中，最小生成树也一直是一个比较热门的话题，该源码能够为对此话题感兴趣的朋友一些参考。-The source code for the minimum spanning tree diagram of the C++ implementation, the problems associated with the FIG, the minimum spanning tree has been a hot topic, the source code can be interested in this topic as a friend some reference. Platform: |
Size: 1024 |
Author:秦志坚 |
Hits:
Search - minimum spanning tree code