Search - prim algorithm

Search - prim algorithm - List

[CSharp] 生成树 DL : 0: 一个最小生成树,包括prim算法,可以生成一个最小生成树-a minimum spanning tree, including Prim algorithm can generate a minimum spanning tree
Date : 2008-10-13 Size : 1.28kb User : 张立博
[CSharp] pri算法 DL : 0: 这是一个数据结构的课程设计采用最小生成树的ＰＲＩＭ算法-This is a data structure courses designed using the minimum spanning tree algorithm PRIM
Date : 2008-10-13 Size : 5.02kb User : pzh
[CSharp] 生成树 DL : 0: 一个最小生成树,包括prim算法,可以生成一个最小生成树-a minimum spanning tree, including Prim algorithm can generate a minimum spanning tree
Date : 2026-01-23 Size : 1kb User : 张立博
[CSharp] pri算法 DL : 0: 这是一个数据结构的课程设计采用最小生成树的ＰＲＩＭ算法-This is a data structure courses designed using the minimum spanning tree algorithm PRIM
Date : 2026-01-23 Size : 5kb User : pzh
[CSharp] shortest DL : 0: 实现中国铁路最短路径的计算，基于图的PRIM算法，MFC实现动态演示-China Railway the shortest path to achieve the calculation of the PRIM algorithm based on the map, MFC dynamic presentation
Date : 2026-01-23 Size : 1.87mb User : zhangyan
[CSharp] Olympic DL : 0: 奥运场馆的规划问题。各场馆位置分散，根据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
Date : 2026-01-23 Size : 952kb User : 岳飞
[CSharp] PrimTomin DL : 0: 用普里姆(Prim)算法构造最小生成树。是数据结构中的经典试题-With Prim (Prim) Constructing Minimum Spanning Tree Algorithm
Date : 2026-01-23 Size : 880kb User : crystalever
[CSharp] prim DL : 0: 输入任意的一个网，用普里姆(Prim)算法构造最小生成树。-Enter any one network, with the prim (Prim) algorithm to construct minimum spanning tree.
Date : 2026-01-23 Size : 1kb User : 雅静
[CSharp] prim DL : 1: 基于最小生成树定理实现图最小生成树的prim算法-Implementation plan based on the theorem of minimum spanning tree minimum spanning tree algorithm prim
Date : 2026-01-23 Size : 185kb User : isabel dong
[CSharp] Prim DL : 0: 算法特点：该算法的特点是当前形成的集合T始终是一棵树。将T中U和TE分别看作红点和红边集，V-U看作蓝点集。算法的每一步均是在连接红、蓝点集的紫边中选择一条轻边扩充进T中。MST性质保证了此边是安全的。T从任意的根r开始，并逐渐生长直至U=V，即T包含了 C中所有的顶点为止。MST性质确保此时的T是G的一棵MST。因为每次添加的边是使树中的权尽可能小，因此这是一种"贪心"的策略。 -Algorithm characteristics: the algorithm is characterized by the formation of the current set of T is always a tree. The T, U and TE were seen as red dots and red edge set, VU as a blue dot set. Every step of the algorithm are connecting the red, blue, choose a set of purple fringing to expand into the T in the light side. The nature side of MST to ensure that this is safe. T starting from any root r, and gradually grow up to U = V, ie T contains all the vertices of C so far. MST to ensure that this time the nature of the tree T is a G MST. Because each side is to add the right tree as small as possible, so this is a " greedy" strategy.
Date : 2026-01-23 Size : 1kb User : 吕济根
[CSharp] Graphs DL : 0: 关于图的一些基本操作：创建、深度遍历、广度遍历、Prim算法、等等。-Some basic operations on graphs: Create, traverse the depth, breadth traversal, Prim algorithm, and so on.
Date : 2026-01-23 Size : 239kb User : 胡孝磊
[CSharp] Graph DL : 0: 基于Virtual C++的数据结构中图的应用，能实现从文件输入有向图和无向图易邻接表和邻接矩阵的形式在屏幕输出，同时能实现无向图的深度遍历输出和广度遍历输出；kruskal算法和Prim算法实现最小生成树的创建；Dijkstra算法实现最短路径的计算；以及最小偏心距的计算。-Application of data structure of Virtual in C++ based on graph, can be achieved the file input directed graphs and undirected graph adjacency list and the adjacency matrix is easy to form on the screen output, at the same time, can realize the undirected graph depth first traversal and breadth traversal output output Kruskal algorithm and Prim algorithm to achieve the creation of the Oki Nariki Dijkstra algorithm the shortest path calculation and the calculation of minimum eccentricity.
Date : 2026-01-23 Size : 1.03mb User : 易新宇
[CSharp] greedy DL : 0: 1）编程实现背包问题贪心算法和最小生成树prim算法。通过具体算法理解如何通过局部最优实现全局最优，并验证算法的时间复杂性。 2）输入5个的图的邻接矩阵，程序加入统计prim算法访问图的节点数和边数的语句。 3）将统计数与复杂性函数所计算的比较次数比较，用表格列出比较结果，给出文字分析。 4）背包问题的实验数据如下表：n=8,m=110 -1) programming to implement the knapsack problem greedy algorithm and minimum spanning tree prim algorithm. Through the concrete algorithm, it is understood how to achieve the global optimization through local optimization, and the time complexity of the algorithm is verified. 2) enter the adjacency matrix of the 5 graphs, add the number of nodes and the number of edges in the prim algorithm. 3) comparison of the number of statistics and the calculation of the complexity function, the comparison results are listed in the table. 4) the experimental data of knapsack problem are as follows: m=110, n=8
Date : 2026-01-23 Size : 12kb User : 陈倩
[CSharp] prim DL : 0: 使用prim算法生成最小生成树，并输出矩阵-The use of prim algorithm to generate the minimum spanning tree, and the output matrix
Date : 2026-01-23 Size : 303kb User : 林翔
[CSharp] pulimu DL : 0: 普里姆算法最小生成树，和数据结构和算法的基础知识-Prim minimum spanning tree algorithm
Date : 2026-01-23 Size : 2kb User : 张爽
[CSharp] 最小生成树 DL : 0: 给定一个地区的n个城市间的距离网，用Prim算法或Kruskal算法建立最小生成树，并计算得到的最小生成树的代价。(Given a distance network between n cities in a region, a minimum spanning tree is constructed by using Prim algorithm or Kruskal algorithm, and the cost of the minimum spanning tree is calculated.)
Date : 2026-01-23 Size : 1.66mb User : 吧啦啦