搜索资源列表
GZ
- 给定一个地区的n个城市间的距离网，用Prim算法或Kruskal算法建立最小生成树，并计算得到的最小生成树的代价。-Given a region n the distance between cities network, using Prim algorithm or Kruskal minimum spanning tree algorithm, and calculate the cost of the minimum spanning tree.
grapgh_prim
- 数据结构：图的Prim算法开发环境visual C/C-图的Prim算法，开发环境visual C/C++
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
prim
- This little program count prime numbers. Little but fast solution. (not grid/cloud resources).
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
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
prim3
- 最小生成树 最小生成树 prim-Minimum spanning tree minimum spanning tree minimum spanning tree minimum spanning tree prim
Primalgorithm
- 普里姆算法求最小生成树(邻接表存储)，用c++描写的，数据结构中的-Prim algorithm for minimum spanning tree (adjacent table storage), with c++ descr iption, data structure
ALGO-11
- Prim algorithm to find shortest path in graph
wuxiangtu5
- 普里姆算法构造最小生成树 -Minimum Spanning Tree Algorithm prim prim Minimum Spanning Tree Algorithm
prim
- 数据结构中的最小生成树实现，根据核心算法在Visual studio6.0的开发环境中运行成功。-Data structure to achieve the minimum spanning tree, according to the core algorithm in the development environment Visual studio6.0 run successfully.
minimum
- minimum spanning tree problem, kruskal and prim algorithms.Program gets matrix as an input
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
Prim
- 这是一个一元多项式运算的数据结构的课程设计，适合大多人的使用-This is a one dollar computing polynomial data structure design, suitable for most people the use of
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
B
- Prim算法完整实现代码收藏 用Prim算法求无向图的最小生成树 -Prim algorithm to achieve a complete collection of code using Prim algorithm for undirected graph of the minimum spanning tree
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