搜索资源列表
Graph
- 输入一个带权无向图的顶点数、边数、各条边信息（两个顶点和权值），建立该图的邻接矩阵结构，输出该邻接矩阵。将上述无向图邻接矩阵转换为邻接表结构，输出该邻接表；根据该邻接表对无向图进行深度优先遍历序列和广度优先遍历序列，并输出遍历结果；用prim算法实现构造该带权无向图的最小生成树，并将该最小生成树的各条边信息输出。-Enter a weighted undirected graph with vertices, edges, each of the side information (two ve
AGMPrim-(Fazel)
- This the AGM Prim algorithm, find the shortest patch -This is the AGM Prim algorithm, find the shortest patch
shortest_path
- 单源点最短路径的实现。采用邻接矩阵的数据结构，ＰＲＩＭ算法实现。-Single-source shortest path. Adjacency matrix data structure, PRIM algorithm.
prim
- Prim s algorithm is an algorithm in graph theory that finds a minimum spanning tree for a connected weighted graph. This means it finds a subset of the edges that forms a tree that includes every vertex, where the total weight of all the edges in the
Prim
- 用于求解旅行商最短路径问题的Prim算法，是一种经典的构造型算法，可用于论文实验的对比参照-Prim shortest path algorithm is used to solve the traveling salesman problem, is a classic stereotype algorithm can be used to compare the experimental reference papers。
Prim
- 输入任意的一个网，用普里姆(Prim)算法构造最小生成树。-Enter any of a network, with Prim (Prim) minimum spanning tree algorithm.
minimum-spanning-tree_prim
- 用C++实现的最小生成树,使用Prim(普里姆)算法.-C++ achieved with the minimum spanning tree, using Prim (Prim) algorithm.
main
- 1.掌握图的基本存储方法：邻接矩阵和邻接表（本程序中使用邻接矩阵）； 2.掌握有关图的基本操作算法并能使用高级语言实现（本程序使用C语言）； 3.掌握图的深度优先搜索遍历和广度优先搜索遍历算法； 4.掌握图的最小生成树的两种算法：prim算法和kruskal算法。 5.掌握图的最短路径的两种算法：DIJ算法和floyd算法。 -1 The basic storage methods mastered graph: adjacency matrix and adjacency
test1
- Prim算法的C语言实现，构造连通图，寻找N个点的最短路径。-Prim algorithm C language implementation of connected graph structure, looking for N point of the shortest path.
Prim
- This is an implementation of Prim s Algorithm using adjacency matrix.
PrimAdjLinkList
- 这可以作为头文件；图结构中，基于邻接链表的prim算法-Graph, adjacency list based on prim algorithm
Prim-And-Dijkstra
- 这个程序是图的综合操作中的最小生成树中普利姆算法和最短路径迪杰斯特拉算法的代码！-This program is a comprehensive diagram of the operation of the minimum spanning tree algorithm and plym Dijkstra shortest path algorithm code!
mintree
- 根据画出的图，计算权值利用prim算法得到最小生成树。-According to draw a diagram, using the weight values are prim algorithm to get minimum spanning tree.
prim
- 最小生成树prim算法实现 实现数据结构中的最小生成树算法prim，获得一棵最小生成树-Prim minimum spanning tree algorithm data structure to achieve the minimum spanning tree algorithm prim, obtain a minimum spanning tree
Graph-algorithm-and-Matlab-program
- 求单源最短路径的Dijkstra算法的Matlab程序 求Euler回路的Fleury算法的Matlab程序 求最小生成树的Prim算法的Matlab程序 求Huffman树的Matlab程序 最大流算法Matlab程序 求任意两点间最短路的Floyd算法的Matlab程序 -Seeking single-source shortest path Dijkstra algorithm Matlab program Euler circuit Fleury seekin
prim
- 最小生成树算法，利用c语言编写，用vc++运行即可-Minimum spanning tree algorithm, using c language, can be run using vc++
Graph
- 基于Virtual C++的数据结构中图的应用，能实现从文件输入有向图和无向图易邻接表和邻接矩阵的形式在屏幕输出，同时能实现无向图的深度遍历输出和广度遍历输出；kruskal算法和Prim算法实现最小生成树的创建；Dijkstra算法实现最短路径的计算；以及最小偏心距的计算。-Application of data structure of Virtual in C++ based on graph, can be achieved the file input directed graphs
Alg_Prim
- Prim algorithm implementation in java, it useful and will help you!
greedy
- 1）编程实现背包问题贪心算法和最小生成树prim算法。通过具体算法理解如何通过局部最优实现全局最优，并验证算法的时间复杂性。 2）输入5个的图的邻接矩阵，程序加入统计prim算法访问图的节点数和边数的语句。 3） 将统计数与复杂性函数所计算的比较次数比较，用表格列出比较结果，给出文字分析。 4）背包问题的实验数据如下表：n=8,m=110 -1) programming to implement the knapsack problem greedy algorithm and
power-system
- c++实现电网建设造价模拟系统,使用了kruskal和prim两种算法，学习数据结构图的好练习-using kruskal and prim algorithm to develop a system to simulate power network