搜索资源列表
FuzzyMST
- 基于模糊费用最小生成树的算法 的源代码 prim算法 模糊数综合排序-Costs based on fuzzy algorithm for minimum spanning tree algorithm source code prim integrated sort fuzzy numbers
MST
- 最小生成树的几种算法的实现，包括克鲁斯卡尔和Prim算法-Minimum Spanning Tree Algorithms of implementation, including the Kruskal and Prim algorithms
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
Primalgorithm
- 普里姆算法求最小生成树(邻接表存储)，用c++描写的，数据结构中的-Prim algorithm for minimum spanning tree (adjacent table storage), with c++ descr iption, data structure
wuxiangtu5
- 普里姆算法构造最小生成树 -Minimum Spanning Tree Algorithm prim prim Minimum Spanning Tree Algorithm
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
LL_Path_optimization
- 【系统功能】 LL-路径优化系统主要用于求解已知坐标的规模为N的城镇间最短路径问题。 【主要算法】 1：利用Prim算法求解带约束条件的连通图的最小生成树； 2：利用基于单亲遗传算法求解带约束条件的TSP问题。 -【Function】 LL-path optimization system is mainly used to solve the known coordinates for the N scale of the problem of the shortest p
071806210
- (1)、了解无向图和有向图的概念 (2)、掌握无向连通图或有向连通图的最小生成树的构造算法既Prim算法 (3)、了解有向图跟无向图的最短路径的解法 (4)、掌握图与网的基本概念和基本存储方法 -make your 111111111111
222222222222
- 1． 利用克鲁斯卡尔算法求网的最小生成树。 2． 利用普里姆算法求网的最小生成树。 3． 要求输出各条边及它们的权值。 -1. Using Kruskal' s algorithm for minimum spanning tree network. 2. Prim algorithm for the use of the minimum spanning tree network. 3. Requirements of the output of each side, and
primkruskal
- MATLAB 图论中经常涉及的球最小生成树的prim和kruskal算法-prim+and+kruskal
span-tree
- 最小生成树算法，克鲁斯卡算法和prim算法，数据结构必备。-Minimum spanning tree algorithms, data structures required.
a
- 最小生成树C语言描述，采用了Prim算法，提高程序运行速度-C language to describe the minimum spanning tree, using Prim algorithm, improve the running speed
091017prim
- 用prim算法求最小生成树.C语言中关于图一章的很好的理解例子。对初学者很有用。-Seek the minimum spanning tree with the prim algorithm. C language on the map a good understanding of the chapter examples. Very useful for beginners.
FindaMininalSpanningTree
- 输入含权图的邻接矩阵，输出最小生成树的邻接矩阵 1、本实验用到的理论知识 Prim算法 算法设计 设图G =（V，E），其生成树的顶点集合为U。 ①、把v0放入U。 ②、在所有u∈U，v∈V-U的边(u，v)∈E中找一条最小权值的边，加入生成树。 ③、把②找到的边的v加入U集合。如果U集合已有n个元素，则结束，否则继续执行②。-Enter the right graph with adjacency matrix, the output of the ad
tree
- 求最小生成树的实验代码和结果，用到Prim算法-Seeking the minimum spanning tree of the experimental code and results, used Prim algorithm
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
1111
- 实现最小生成树 采用了普里姆（Prim）算法求网的最小生成树-smallest tree
33u
- 最小生成树的prim算法。。用邻接矩阵实现-Prim algorithm for minimum spanning tree. . With the adjacency matrix to achieve
zhonghuan
- 课程设计题目∶ 设计程序完成如下功能： 对给定的网和起点，实现求解最小生成树的PRIM算法，并给出求解过程的动态演示。-Curriculum topics: design process is complete the following functions: For a given network and the starting point to achieve the PRIM algorithm for solving minimum spanning tree, and giv