搜索资源列表
MST
- 实现最小生成树的算法（包括Kruskal和Prim算法） 在codeblocks下运行-Achieve the minimum spanning tree algorithm
PrimTomin
- 用普里姆(Prim)算法构造最小生成树。是数据结构中的经典试题-With Prim (Prim) Constructing Minimum Spanning Tree Algorithm
Prim1
- 本程序用C语言实现了Prim算法求解最小生成树问题-The program uses C language to implement the Prim algorithm for minimum spanning tree problem
pu
- 对右边的无向带权图，按普里姆算法求其最小生成树-On the right side of undirected weighted graph, by Prim algorithm to solve the minimum spanning tree
Primsuanfa
- 用prim算法求带权图的最小生成树，最小生成树的边集合存在mst数组中-With prim algorithm for getting the right plan with the minimum spanning tree, minimum spanning tree of the edge set of the array there mst
min_tree
- 从conf.txt文件读取无向图矩阵 PRIM算法分步实现最小生成树-File read from conf.txt PRIM algorithm for undirected graph matrix step by step to achieve the minimum spanning tree
kruscal_Primspanningtree
- 最小生成树两种经典算法,kruscal和Prim算法-spanning tree
dsft
- 对于如图8.30所示的无向带权图G，采用普里姆算法输出从顶点0出发的最小生成树。-As shown in Figure 8.30 for the undirected weighted graph G, using Prim algorithm output starting from the vertex 0 the minimum spanning tree.
Minimum-spanning-tree
- 网的邻接矩阵存储（数组表示）、简单输出，最小生成树，采用Prim算法实现最小生成树。-Network adjacency matrix storage (array representation), a simple output, minimum spanning tree, minimum spanning tree using Prim algorithm.
prim1
- prim,求最小生成树的普利姆算法 。求最小生成树的普利姆算法。。 -prim
1
- 按照图的“邻接巨阵”存储结构实现最小生成树的Prim算法-Accordance with the plans of the " adjacent downline" storage structure Prim minimum spanning tree algorithm to achieve
PrimAlgorithm
- 数据结构——邻接矩阵表示图，普里姆算法程序实现最小生成树-Data structure- adjacency matrix graph, Prim algorithm for minimum spanning tree procedure
5-1
- 关于图的最小生成树的prim算法，发上来分享下-On the minimal spanning tree algorithm prim, hair up under shared
spanning_tree
- 最小生成树的Prim 和Kruscal算法-Prim minimum spanning tree algorithm and Kruscal
program-3
- 压缩包包含三个程序 分别是动态规划解奶牛家谱问题，普里姆算法求最小生成树，回溯法解决24点问题-Package contains three programs are the problem of dynamic programming solutions cow family tree, Prim for the Minimum Spanning Tree, backtracking to solve the problem 24 points
MST
- 最小生成树算法代码，采用堆的知识，并用prim算法来实现。-Minimum spanning tree algorithm code, using of the heap , and with the prim algorithm to achieve.
graph
- 如何进行图的创建及最小生成树的生成，以及PRIM-Creating graphs and minimum spanning tree
MST_prim.c
- 用prim算法计算最小生成树的总权值和最优连线。-Prim minimum spanning tree algorithm with the total group and the best connection.
greedy
- 这是算法设计与分析课程实验， 贪心算法实验的简单的源代码，包括汽车加油，多级调度问题 ，prim最小生成树-This is the algorithm design and analysis course experiment, the experiment simple greedy algorithm source code, including vehicle refueling, multi-level scheduling problem, prim MST
KrusklaPrim
- 最小生成树 Kruskal和Prim的比较 可以根据用户输入的点数和边数随机生成图并且保证是连通图-Kruskal and Prim' s minimum spanning tree can compare the number of points based on user input and the edges are randomly generated map and ensuring that connected graph