搜索资源列表
prim
- 算法简介:Prim算法用于求无向图的最小生成树 设图G =（V，E），其生成树的顶点集合为U。 ①、把v0放入U。 ②、在所有u∈U，v∈V-U的边(u，v)∈E中找一条最小权值的边，加入生成树。 ③、把②找到的边的v加入U集合。如果U集合已有n个元素，则结束，否则继续执行②。 其算法的时间复杂度为O（|E|log|V|）-Introduction to Algorithms: Prim algorithm used to find the undire
scj_Graph
- 数据结构中有关图的创建，存储显示，深度，广度优先遍历算法，以及最小生成树Prim和Kruscal算法实现-The map data structure to create, store display, the depth, breadth-first traversal algorithm, and Prim minimum spanning tree algorithm and Kruscal
Prim
- prim 最小生成树 输入为邻接矩阵 输出是相应的边-minimum spanning tree
prim
- 最小生成树算法，prime算法，绝对能运行-Minimum spanning tree algorithm, prime algorithm can certainly run
prim
- prim算法实现最小生成树，一个较为简洁的代码。-prim minimum spanning tree algorithm, a more concise code.
Prim
- 用C语言编写的最小生成树的改进普林算法，可以从任意节点开始生成最小生成树-Written in C language, Princeton improved minimum spanning tree algorithm, starting from any node to generate the minimum spanning tree
Prim
- Prim算法求连通加权无向图的最小生成树,在VS2010下编写并测试通过-Prim algorithm for connected weighted undirected graph, minimum spanning tree.
prim
- 学习了解最小生成树，利用prim算法将已知树输入，然后生成最小生成树-Learn about the minimum spanning tree, using the prim algorithm will known tree input, and then generate minimum spanning tree
prim
- prim最小生成树的详细代码，你可以使用它来实现在数据结构课程中学到的prim算法。-a source code of the prim minimum panning tree
prim
- 最小生成树的Prim算法，利用Prim算法求解不带约束条件的连通图的最小生成树。-The minimum spanning tree Prim algorithm
graphtree
- 0、显示该图的邻接矩阵1、广度优先遍历2、深度优先遍历3、最小生成树PRIM算法-0, the adjacency matrix 1 breadth-first traversal 2, depth-first traversal 3, the minimum spanning tree PRIM algorithm
prim
- 普利姆算法用来求解最小生成树问题很容易，使得树的最小权值最小。-Prim algorithm used to solve the minimum spanning tree problem is easy, the minimum weight is the lowest of the tree
Prim
- 利用数据图结构实现最小生成树的普里姆算法-Use data figure structure realize the minimum spanning tree PuLiM algorithm
prim
- 中山大学软件工程大一，最小生成树的源代码。-Sun Yat-sen University Software Engineering freshman, minimum spanning tree of source code.
Graph-theory-algorithm-set
- 对matlab解决图论问题的算法做个汇总。主要包括：顶点覆盖近似算法、哈密尔顿回路、最大流和最小截、最短路和次短路、最小生成树Prim算法、最短路径等等。由于太多就不一一列举了。-Matlab to solve the problem of graph theory algorithms to be aggregated. Include: vertex cover approximation algorithm, Hamilton circuit, the maximum flow and m
MST_47702
- 图的深度广度遍历和最小生成树PRIM和KRUSCA-Depth breadth traversal of the graph and the minimum spanning tree PRIM and KRUSCA, ....
Prim-algorithm
- 此代码用VC6.0开发，包含全部代码，内容为用prim算法实现最小生成树。-The VC6.0 development of this code contains all the code, the content of prim algorithm to achieve the minimum spanning tree.
Prim-for-minimum-spanning-tree
- 对给定的网和起点，实现求解最小生成树的Prim算法-Prim algorithm for solving the minimum spanning tree of a given network and the starting point
Prim
- prim算法，用c++程序实现,可以解决图论的最小生成树问题-prim algorithm which can solove the graph theory with c++
Matlab-algorithm-important
- 本压缩包包括matlab的顶点覆盖近似算法、哈密尔顿回路、模拟退火应用、最大流和最小截、最短路和次短路、最短路径、最小生成树prim算法等，带有源程序和中文说明文档，此文件夹中的文件，如需被利用，则要直接放至work目录下。-The compressed packet including matlab vertex cover approximation algorithm, Hamilton circuit, simulated annealing, maximum flow and mini