搜索资源列表
Soft20060210162206769
- PRIM算法 一个基本的算法 可以和其他程序结合使用 加密 -EBLSS algorithm for a basic algorithm and other procedures with the use of encryption
Priml
- 这是一个小小的程序,用来演示图的prim算法-This a minor procedure, the map used to demonstrate the algorithm prim
sting6.doc
- 普里姆构造最小生成树算法 图或网的邻接矩阵表示及其上基本算法的实现-prim minimum spanning tree algorithm tectonic map of the network or matrix and adjacency on the realization of basic algorithm
最小生成树1
- 本程序是一个用prim算法寻找最小生成树的小程序。-this procedure is a prim with minimum spanning tree algorithm for small procedures.
MST
- 最小生成树prim算法matlab实现,计算出总权值和最优连线。-Minimum spanning tree algorithm matlab prim implemented to calculate the total weight and the optimal connection.
UnDirectGraph
- 本程序实现了《数据结构》课本中无向图的基本算法,包括图的构造、图的深度、广度优先遍历算法、用Prim、Kruskal算法构造最小生成树以及分别用Dijkstra、Floyd算法求源点到所有顶点、图中任意两点间的最短路径,并给出具体的路径 -This procedure achieved a " data structure" textbooks undirected graph the basic algorithm, including graphs, graph depth
2007011402
- 最小树生成算法,用prim算法实现最小树生成-Minimum spanning tree generation algorithm, using prim minimum spanning tree algorithm to generate
djkstl
- 最小生成树Prim算法和最短路Dijkstra算法◎联系与衍生-Prim minimum spanning tree algorithm and Dijkstra shortest path algorithm derived ◎ Contact
FuzzyMST
- 基于模糊费用最小生成树的算法 的源代码 prim算法 模糊数综合排序-Costs based on fuzzy algorithm for minimum spanning tree algorithm source code prim integrated sort fuzzy numbers
tudebianli
- 图的遍历和生成树求解实现(邻接矩阵、邻接表 ―图的深度广度遍历算法的实现和最小生成树PRIM和KRUSCAL算法的实现) -Graph Traversal and Spanning Tree Solution implementation (adjacency matrix, adjacency list- map the depth of breadth traversal algorithm and implementation of the minimum spanning tree al
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
guangdusousuo
- 宽度优先搜索算法(又称广度优先搜索)是最简便的图的搜索算法之一,这一算法也是很多重要的图的算法的原型。Dijkstra单源最短路径算法和Prim最小生成树算法都采用了和宽度优先搜索类似的思想-Breadth-first search algorithm (also known as breadth-first search) is the most simple plan, one of the search algorithm, this algorithm is also a lot of
wuxiangtu5
- 普里姆算法构造最小生成树 -Minimum Spanning Tree Algorithm prim prim Minimum Spanning Tree Algorithm
yuandaima
- 一般背包问题的贪心算法 Dijkstra算法求解单源最短路径问题 N皇后问题 Prim算法 Kruskal算法代码-The general knapsack problem greedy algorithm Dijkstra' s algorithm for single-source shortest path algorithm N Queen' s problem Kruskal Algorithm Prim code
yiyuanduoxiANSHI
- 这是一个Prim算法求最小生成树的课程设计,相信会适合大多数人的使用-This is a Prim minimum spanning tree algorithm for the curriculum design, would be suitable for the majority of people believe that the use of
Olympic
- 奥运场馆的规划问题。各场馆位置分散,根据Prim算法求最小生成树,这是算法主体-Planning of the Olympic venues. Various venues in scattered locations, according to Prim minimum spanning tree algorithm is seeking, which is the main algorithm
suanfajihe
- ( Rightmost Digit )代码:数论模幂算法(从左向右)0ms 最小公倍数-辗转相除法 Prim最小生成树-Rightmost Digit, modular exponentiation algorithm (from left to right) 0ms Least common multiple- Euclidean algorithm Prim minimum spanning tree
MST
- 实现最小生成树的算法(包括Kruskal和Prim算法) 在codeblocks下运行-Achieve the minimum spanning tree algorithm
PrimTomin
- 用普里姆(Prim)算法构造最小生成树。是数据结构中的经典试题-With Prim (Prim) Constructing Minimum Spanning Tree Algorithm
PrimGraph
- Prim´ s algorithm using graphics finds a minimum spanning tree for a connected weighted undirected graph.