搜索资源列表
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
- 单源点最短路径的实现。采用邻接矩阵的数据结构,PRIM算法实现。-Single-source shortest path. Adjacency matrix data structure, PRIM algorithm.
Main
- 普里姆算法(Prim算法),图论中的一种算法,可在加权连通图里搜索最小生成树。意即由此算法搜索到的边子集所构成的树中,不但包括了连通图里的所有顶点,且其所有边的权值之和亦为最小。
shumoshiyan
- 实验一:数据浓缩与图示 实验二:数据的预处理 实验三:家庭人均生活消费的主成份分析 实验四:家庭人均收入与支出指标的典型相关分析 实验五:用最短路算法求解航空票价最便宜的路线图 实验六:用prim算法和Kruskal算法求最小生成树-Experiment one: Data enrichment and icons Second experiment: data preprocessing Experiment III: Principal component ana
ArbreCouvrantMinimal
- there PRIM, Kruskal and Dijkstra algorithm implemented in Java to calculate the spanning tree of a graph.
Prims
- PRIM算法--最小生成树,可以用来求最短路径,和克鲁兹卡尔算法有些类似-the minimum tree!
GRAPH
- 实现无向图及其基本操作; 利用Prim算法实现图的最小生成树; 利用Kruskal算法实现图的最小生成树。 -Achieve an undirected graph and its basic operations utilize Prim minimum spanning tree algorithm graph use Kruskal minimum spanning tree algorithm graph.
poj1789
- poj1789 Truck History prim
prime
- 这是一个MFC工程,包括可执行文件以及源代码。对素数判定有两种方法,一种是Erato算法,另外是混合判定算法。可以快速且准确的判定一个大数是否为素数。-This is a MFC project and the executive file and the source files are all included in it. There is two kinds of methods to recognize if a number is a prim. One of the methods
PRIM
- 实现无网格法中径向基形函数,基于《无网格法理论及程序设计》-Achieved Meshfree radial basis function
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.
graph
- 掌握图的两种存储结构; 掌握Dijkstra算法; 掌握Prim及Kruskal算法; 邻接矩阵、最短路径及其长度 邻接表、最小生成树 -Learn two storage structure Master Dijkstra algorithm Master Prim and Kruskal algorithm Adjacency matrix, and the length of the shortest path Adjac
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.
tree
- 最小生成树算法的动态演示,具有良好的交互性,支持用鼠标绘图和绘点,Prim算法和Kruskal算法两种的动态过程。-Dynamic presentation minimum spanning tree algorithm, with good interaction, support the use of the mouse for drawing and painting point, Prim algorithms and dynamic process of two of Kruskal&
Map-Theory
- 通信网络课程常用Matlab算法,包括Dijkstra, Floyed,Kruskal,Prim,MaxFlowLabeling以及相关的矩阵转换和节点处理程序-Dijkstra,Floyed,Kruskal,Prim,MaxFlowLabeling and so forth