搜索资源列表
minspant
- 最小生成树，prim算法 还有kruskal算法 两个算法的具体实现还有测试-Minimum spanning tree, prim algorithm also kruskal algorithm implementation has two specific test algorithm
prim
- 最小生成树的pirm算法,用c++语言描述，如有疑问，欢迎咨询-Minimum spanning tree pirm algorithms using c++ language to describe, if in doubt, please consult
BFS.rar
- c语言广度优先搜索算法的实现，输入几个节点，生成树，然后经广度优先搜索算法输出,c language breadth-first search algorithm, enter the number of nodes, spanning tree, and then by the breadth-first search algorithm output
Discrete optimization
- 它包含了枚举法、蒙特卡洛法、线性整数规划、整数规划枚举法、整数规划隐枚举法、非线性整数规划、非线性整数规划图形工具、最小生成树kruskal算法、最短路dijkstra算法、最小生成树kruskal算法mex程序、最短路dijkstra算法mex程序和动态规划的代码。-It contains the matlab code of the enumeration method, Monte Carlo method, linear integer programming, integer prog
djkstl
- 最小生成树Prim算法和最短路Dijkstra算法◎联系与衍生-Prim minimum spanning tree algorithm and Dijkstra shortest path algorithm derived ◎ Contact
graph_
- //有向图:有向图,无向图基本操作 //运行环境：VC //有向图,无向图基本操作,包括: //1、邻接矩阵 //2、邻接表 //3、深度优先遍历 //4、广度优先遍历 //5、最小生成树 //6、拓扑排序 //7、每一对顶点之间的最短路径（Dijkstra,Floyd两种算法）-//Directed graph: directed graph, undirected graph basic operation// Operating Environme
Prim
- 这是一个构造最小生成树的Prim算法，是属于贪心算法的范畴。设G=(V,E)是连同带权图，V={1，2，3，...，n}。构造G的最小生成树。-This is a structure of Prim minimum spanning tree algorithm is a greedy algorithm category. Set G = (V, E) is, together with the weighted graph, V = (1,2,3 ,..., n). G of the min
zuixiaoshengchengshu
- 数据结构最小生成树源代码。希望对大家有用。谢谢！-Minimum spanning tree data structure source code. Hope useful for all of us. Thanks!
mst
- 最小生成树 MST的四种算法实现。 包括普通的Kruskal算法和Prim算法，用Disjoint-Set优化的Kruskal算法和用Heap优化的堆算法。 复杂度分别为O(mn), O(n^2), O(m log n), O(m log n)-Minimum Spanning Tree Algorithm
span-tree
- 最小生成树算法，克鲁斯卡算法和prim算法，数据结构必备。-Minimum spanning tree algorithms, data structures required.
tree
- 数据结构作业最小生成树c语言编写有要的同学拿去-Minimum spanning tree data structure operations are to be students Naqu
TREE
- 建立一个简单的树应用系统。通过该系统实现树相关算法及其应用系统，包括树判别函数最小生成树、哈夫曼树和哈夫曼编码。要求有个良好的输出显示，同时给出相应的算法时间。内含报告，可直接运行。-The establishment of a simple tree applications. Through the system to achieve a tree-related algorithms and applications, including the minimum spanning tree
minimum-spanning-tree
- 一个最小生成树的算法，用C语言写的。初学者，请多多指教，谢谢！-A minimum spanning tree algorithm, written in C language. Beginners, a lot of advice, thank you!
tree.rar
- 数据结构课程设计，关于最小生成树的，希望能帮助大家，挺不错的哈。,Data structure curriculum design, minimum spanning tree, we want to help, very good.
least-tree
- 利用VC实现的最小生成树算法，可能在VC6.0环境下正常运行-VC to achieve the minimum spanning tree algorithm may VC6.0 environment in normal operation
steiner-base-on-min-tree
- xiangx详细介绍了基于最小生成树的施泰纳树问题，还有一种方法是介绍基于最短路径的施泰纳树-xiangx detailing the minimum spanning tree based Steiner tree problem, there is a way to introduce the shortest path based Steiner tree
Minimum-spanning-tree
- 最小生成树，可以实现构建最小生成树的目的。-Minimum spanning tree, you can achieve the purpose of constructing a minimum spanning tree.
kruskal-Minimum-Spanning-Tree
- 普里母和kruskal 生成最小生成树 普里母和kruskal 生成最小生成树 -Minimum Spanning Tree
Minimum-Spanning-Tree
- 该源码为图的最小生成树的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 cod