搜索资源列表
-
0下载：
最小生成树Prim算法和最短路Dijkstra算法◎联系与衍生-Prim minimum spanning tree algorithm and Dijkstra shortest path algorithm derived ◎ Contact
-
-
0下载：
这是一个构造最小生成树的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
-
-
0下载：
最小生成树 MST的四种算法实现。
包括普通的Kruskal算法和Prim算法，用Disjoint-Set优化的Kruskal算法和用Heap优化的堆算法。
复杂度分别为O(mn), O(n^2), O(m log n), O(m log n)-Minimum Spanning Tree
Algorithm
-
-
0下载：
prim算法构造最小生成树，调试通过，c++语言编写。-Minimum Spanning Tree Algorithm prim, debugging through, c++ languages.
-
-
0下载：
自己写的图论的一些基本算法，有找关键路径，最短生成树，Prim算法-On their own plans to write some of the basic algorithm, there is to find the critical path, minimum spanning tree, Prim algorithm, etc.
-
-
0下载：
构造最小生成树的常用方法是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.
-
-
0下载：
C语言实现普里姆算法 根据无向网构造最小生成树-C language implementation Prim algorithm based on minimum spanning tree in undirected network structure
-
-
0下载：
( Rightmost Digit )代码：数论模幂算法（从左向右）0ms
最小公倍数-辗转相除法
Prim最小生成树-Rightmost Digit, modular exponentiation algorithm (from left to right) 0ms
Least common multiple- Euclidean algorithm
Prim minimum spanning tree
-
-
0下载：
prim算法 ，输入一个图，然后 求它的最小生成树 -prim algorithm, input a graph, and then seek its minimum spanning tree
-
-
0下载：
Prim和Kruscal的最小生成树算法-Prim minimum spanning tree algorithm and Kruscal
-
-
0下载：
此代码用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.
-
-
0下载：
最小生成树算法，prim算法，c语言实现-Minimum spanning tree algorithm, prim algorithm, c language
-
-
0下载：
数据结构与算法的经典例题， 求最小生成树的算法之一， prim算法。-Data Structures and Algorithms classic example, find the minimum spanning tree algorithms, prim algorithm.
-
-
0下载：
陈晓东 计算机算法与设计 最小生成树的Prim算法-Daniel and design of computer algorithms Prim minimum spanning tree algorithm
-
-
0下载：
prim算法输出一个最小生成树，prim算法最先是找到一个根节点，然后在继续生成最小生成树，这样就能找到一个最小生成树，如果是这样的话，我们可以用一个循环，把每一个节点当作根节点，再把重复的树删除，这样就能找到所有的最小生成树了-algorithm prim, prim algorithm was first to find a root node, and then continue to generate the minimum spanning tree, so that we can f
-
-
0下载：
实验一：数据浓缩与图示
实验二：数据的预处理
实验三：家庭人均生活消费的主成份分析
实验四：家庭人均收入与支出指标的典型相关分析
实验五：用最短路算法求解航空票价最便宜的路线图
实验六：用prim算法和Kruskal算法求最小生成树-Experiment one: Data enrichment and icons
Second experiment: data preprocessing
Experiment III: Principal component ana
-
-
0下载：
Prim算法，解决最小生成树问题，是图论中一个很重要的算法-Prim algorithm to solve the minimum spanning tree problem is a very important graph theory algorithms
-
-
0下载：
这个程序是图的综合操作中的最小生成树中普利姆算法和最短路径迪杰斯特拉算法的代码！-This program is a comprehensive diagram of the operation of the minimum spanning tree algorithm and plym Dijkstra shortest path algorithm code!
-
-
0下载：
最小生成树算法，利用c语言编写，用vc++运行即可-Minimum spanning tree algorithm, using c language, can be run using vc++
-
-
0下载：
采用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
-
