搜索资源列表
MapGuid
- 我写的,画出最短路径,及最小生成树 Prim Dijistra算法+ GDI实现-I write to depict the shortest path, and the smallest Prim Dijistra Spanning Tree Algorithm to achieve GDI
MSTVisual
- 最小生成树的算法演示，可自由添加结点和移动结点，边的权重也可自由更改-minimum spanning tree algorithm demonstration of the freedom to add nodes and mobile nodes, while the weights are free to change
algrithm
- 算法设计与分析的经典程序，主要有0-1背包问题，最小生成树等。-algorithm design and analysis of the classic procedure, mainly 0-1 knapsack problem, such as minimum spanning tree.
Data_Struction_prim_MST
- 数据结构作业代码。 最小生成树 Prim实现。 win32 Console界面。-operation code data structure. Prim achieve the minimum spanning tree. Win32 Console interface.
kruskal_matlab
- 最小生成树的kruskal算法 自己写的 要是再说有重复 我可就怒了-the Kruskal minimum spanning tree algorithm wrote it myself if I say that there is no duplication of anger on
7_7Kruskal
- 最小生成树的经典算法——Kruskal算法。用C++实现-minimum spanning tree algorithm classic-- Kruskal algorithm. C to achieve
smallest_tree
- 用C++实现的最小生成树的算法，很简单，但对于初学者来说很有用-C to achieve the minimum spanning tree algorithm is very simple, but for a newcomer useful
clc
- 用matalb程序来实现求一个连通图的最小生成树-matalb procedures used to achieve a graph for the minimum spanning tree
prime-tree
- 最小生成树：利用普鲁姆算法，完成将给定节点和边的权值的图生成最小生成树，用于各项公共事业最少经费的设计方法-minimum spanning tree : pass algorithm, Givens completed nodes and the right side of the value of the minimum spanning tree generation for public utilities at least f
MiniSpanTree_Kruskal
- 最小生成树算法程序，已经通过编译的程序，能运行出结果-minimum spanning tree algorithm, compiled by the procedure, the results can run
thesmallesttree
- 这是数据结构课老师布置的上机作业，最小生成树源码-This is the data structure layout of the course teachers on the plane operations, the minimum spanning tree FOSS
GraphSmalltree
- 演示了最小生成树的普林算法和克鲁斯卡尔算法得算法过程。-demonstration of the minimum spanning tree algorithm and Chapline Kelushikaer algorithm algorithm in the process.
MinSpanTree
- 最小生成树算法. 包括克卢斯卡尔和普里姆算法-minimum spanning tree algorithm. Including Keleishikaer algorithm and Primbetov
Kru
- Kruskal算法，Kruskal算法的时间复杂度为 ，与图中边数有关，而与图中的顶点数无关，因此该算法适合与求边稀疏的网的最小生成树。-Kruskal algorithm, the algorithm Kruskal time complexity of, and chart the edge, with map unrelated to the number of vertices, and the algorithm for ed
231565262
- 对于个顶点的连通网可以建立许多不同的生成树，每一棵生成树都可以是一个通信网。现在，我们要选择总的耗费最小的那棵树，这就是我们说的最小生成树。本次课程设计就是设计这样的生成树，-for network connectivity can be established in many different spanning tree, every one spanning tree can be a communications network
4.67
- 普里姆算法构造最小生成树，无向图的深度优先搜索。数据结构作业答案。老师写的-Primbetov minimum spanning tree algorithm structure, no plans to the depth-first search. Operating data structure answer. Teachers write! !
smalltree
- 数据结构最小生成树的求法——算法 数据结构可后实习题目-minimum spanning tree data structure for the law-- algorithm data structure can be subject after practice
456456415
- 题目：若要在n个城市之间建立通信网络，只需要假设n－1条线路即可。如何以最低的经济代价建设这个通信网，是一个网的最小生成树问题。-topics : n if the city between communication networks, need only assume that n-1 line can be. How the lowest economic cost of building the communications n
456456413786
- 数据结构课程设计打包下载，包括两个1.约瑟夫环 2.最小生成树问题！！！我已经交给老师，发给大家参考一下-data structure course design package download, including two one. Josephus 2. The minimum spanning tree problem! ! ! I was handed over to the teachers, to your referen
Soft20060210100933557
- 图的建立、遍历、最小生成树、最短路径 图的建立、遍历、最小生成树、最短路径-plans the establishment, traverse, the minimum spanning tree and the shortest road map for the establishment of traversal, minimum spanning tree, shortest path