搜索资源列表
hj
- 图的算法实现 （1）将图的信息建立文件； （2）从文件读入图的信息，建立邻接矩阵和邻接表； （3）实现Prim、Kruskal、Dijkstra和拓扑排序算法。
minspant
- 最小生成树，prim算法 还有kruskal算法 两个算法的具体实现还有测试-Minimum spanning tree, prim algorithm also kruskal algorithm implementation has two specific test algorithm
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
minimum
- minimum spanning tree problem, kruskal and prim algorithms.Program gets matrix as an input
PRIM
- 构造最小生成树的常用方法是Prim算法与Kruskal算法，二者都是基于贪心算法设计侧略。-Construction of the commonly used minimum spanning tree algorithm is Prim and Kruskal algorithms, both are based on the design side of a little greedy algorithm.
acmcontesttemplate
- Bfs，Dijstara，Floyd，Kruskal，Prim，并查集，网络流，Trie等acm竞赛模板-Bfs Dijstara Floyd Kruskal Prim and the set of network flow Trie search such acm contest template
PrimKruskal
- prim kruskal source code
MST
- 实现最小生成树的算法（包括Kruskal和Prim算法） 在codeblocks下运行-Achieve the minimum spanning tree algorithm
GraphAlgorithm
- 图论通用各种算法，有大量实例，包括BFS,DFS,Prim, kruskal,Dijkstra,Floyed,Aoe,Aov,topsort-General algorithms of graph theory, a large number of cases, including the BFS, DFS, Prim, kruskal, Dijkstra, Floyed, Aoe, Aov, topsort
zxscs
- 用prim、kruskal算法生成树， 并输出树的图形(权值、边)-With the prim, kruskal spanning tree algorithm, and output tree graphics (weights, side)
mprim-kruskala
- matlab实现的prim算法法和kruskal算法可直接使用。 -matlab implementation of the prim algorithm France and kruskal of algorithm can be used directly.
shumoshiyan
- 实验一：数据浓缩与图示 实验二：数据的预处理 实验三：家庭人均生活消费的主成份分析 实验四：家庭人均收入与支出指标的典型相关分析 实验五：用最短路算法求解航空票价最便宜的路线图 实验六：用prim算法和Kruskal算法求最小生成树-Experiment one: Data enrichment and icons Second experiment: data preprocessing Experiment III: Principal component ana
graph
- 掌握图的两种存储结构； 掌握Dijkstra算法； 掌握Prim及Kruskal算法； 邻接矩阵、最短路径及其长度 邻接表、最小生成树 -Learn two storage structure Master Dijkstra algorithm Master Prim and Kruskal algorithm Adjacency matrix, and the length of the shortest path Adjac
Graph
- 基于Virtual C++的数据结构中图的应用，能实现从文件输入有向图和无向图易邻接表和邻接矩阵的形式在屏幕输出，同时能实现无向图的深度遍历输出和广度遍历输出；kruskal算法和Prim算法实现最小生成树的创建；Dijkstra算法实现最短路径的计算；以及最小偏心距的计算。-Application of data structure of Virtual in C++ based on graph, can be achieved the file input directed graphs
PRIM100
- 构造最小生成树的常用方法是Prim算法与Kruskal算法，二者都是基于贪心算法设计侧略。-Construction of the commonly used minimum spanning tree algorithm is Prim and Kruskal algorithms, both are based on the design side of a little greedy algorithm.
ConsoleApplication5
- 使用克鲁斯卡尔算法和普里姆算法，使用图形化函数graph.h画出效果图，音频背景部分需自行添加，采用按键监听，直接使用键盘对应按键选择操作(Using the Kruskal algorithm and prim algorithm, using graphical graph.h function to draw renderings, the need to add the background audio part, adopts the key to monitor, directly
616191算法作业
- 1.二分搜索技术2.最接近点对问题3.矩阵连乘问题4.电路布线5.单源最短路径Dijkstra算法6.最小生成树Prim算法7.最小生成树Kruskal算法C语言写的，全部能运行！(algorithm design assignment)
最小生成树
- 给定一个地区的n个城市间的距离网，用Prim算法或Kruskal算法建立最小生成树，并计算得到的最小生成树的代价。(Given a distance network between n cities in a region, a minimum spanning tree is constructed by using Prim algorithm or Kruskal algorithm, and the cost of the minimum spanning tree is calcula
8.7-8.9 MattoList Prim Dijkstra
- 采用prim算法和kruskal算法求最小生成树 采用dijkstra算法求从顶点到其他顶点的最短路径和最短路径长度。(Using prim algorithm and Kruskal algorithm to find minimum spanning tree Dijkstra algorithm is used to find the shortest path and the shortest path length from vertex to other ver
irogramprint
- 对任意给定的网络顶点数和边数自定,建立它的邻接矩阵并输出,然后利用Prim算法或Kruskal算法生成它的最小生成树,()