Hot Search : Source embeded web remote control p2p game More...
Location : Home Search - prim algorithm
Search - prim algorithm - List
用普里姆(Prim)算法构造最小生成树;图的DFS算法的非递归遍历函数。-with Primbetov (PRIM), the minimum spanning tree algorithm constructs; Map of the DFS non - recursive algorithm traversal function.
Date : 2008-10-13 Size : 3.82kb User : 贾德

此程序使用最小生成树Prim算法。用户输入图的输入文件名,程序读此文件,并调用MinSpanTree()为图建立最小生成树。输出包括树的总权及其顶点和边的列表。-This procedure use the Prim algorithm. The user input the filename of the chart, the procedure reads this document and transfers the chart to Minimum SpannirngTree with MinSpanTree () function. Output the table including tree s total power and its apex and side.
Date : 2008-10-13 Size : 6.97kb User : 小山

此程序使用最小生成树Prim算法。用户输入图的输入文件名,程序读此文件,并调用MinSpanTree()为图建立最小生成树。输出包括树的总权及其顶点和边的列表。-This procedure use the Prim algorithm. The user input the filename of the chart, the procedure reads this document and transfers the chart to Minimum SpannirngTree with MinSpanTree () function. Output the table including tree s total power and its apex and side.
Date : 2026-01-23 Size : 7kb User : 小山

用普里姆(Prim)算法构造最小生成树;图的DFS算法的非递归遍历函数。-with Primbetov (PRIM), the minimum spanning tree algorithm constructs; Map of the DFS non- recursive algorithm traversal function.
Date : 2026-01-23 Size : 4kb User : 贾德

prim算法的vc++实现,适合初学者好好学习,愿与朋友们一起进步-prim algorithm vc++ realize is suitable for beginners to study hard, willing to progress together with friends
Date : 2026-01-23 Size : 243kb User : wyl_1113

实现最小生成树算法,通过PRIM算法实现.通过输入一串字符显示最小生成树.求得最小路径-Realize minimum spanning tree algorithm, through the PRIM algorithm. By entering a string of characters show minimal spanning tree. Find the smallest path
Date : 2026-01-23 Size : 5kb User : 一一

Prim algorithm to find shortest path in graph
Date : 2026-01-23 Size : 2kb User : saurabh

prim s algorithm implementation in C++ with graphical output
Date : 2026-01-23 Size : 2kb User : diksha

输入含权图的邻接矩阵,输出最小生成树的邻接矩阵 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 adjacency matrix of a minimum spanning tree, this experiment used the theoretical knowledge Prim algorithm for algorithm design based map G = (V, E), its spanning the vertex set of U. ①, the v0 into U. ②, in all u ∈ U, v ∈ VU edge (u, v) ∈ E in finding a minimum weight edge, by adding spanning tree. ③, ② to find the edge to join the U of v set. If U has a collection of n elements, then the end, otherwise continue ②.
Date : 2026-01-23 Size : 37kb User : jhp627

求最小生成树的实验代码和结果,用到Prim算法-Seeking the minimum spanning tree of the experimental code and results, used Prim algorithm
Date : 2026-01-23 Size : 856kb User : jhp627

应用Prim算法构造最小生成树,是数据结构的节本算法-Application of Prim minimum spanning tree algorithm is constructed, the data section of the structure of the algorithm
Date : 2026-01-23 Size : 8kb User : ddl

最小生成树的prim算法。。用邻接矩阵实现-Prim algorithm for minimum spanning tree. . With the adjacency matrix to achieve
Date : 2026-01-23 Size : 1kb User : 刘芝源

实现最小生成树的算法(包括Kruskal和Prim算法) 在codeblocks下运行-Achieve the minimum spanning tree algorithm
Date : 2026-01-23 Size : 136kb User : 田飞

matlab实现的prim算法法和kruskal算法可直接使用。 -matlab implementation of the prim algorithm France and kruskal of algorithm can be used directly.
Date : 2026-01-23 Size : 2kb User : lusanman

使用克鲁斯卡尔算法和普里姆算法,使用图形化函数graph.h画出效果图,音频背景部分需自行添加,采用按键监听,直接使用键盘对应按键选择操作(Using the Kruskal algorithm and prim algorithm, using graphical graph.h function to draw renderings, the need to add the background audio part, adopts the key to monitor, directly using the keyboard button to select the corresponding operation)
Date : 2026-01-23 Size : 36.92mb User : ~追梦~

prim算法生成最小生成树,得出算法生成结果并输出到控制台。(Prim algorithm generates minimum spanning tree, the algorithm generates results and output to the console.)
Date : 2026-01-23 Size : 2kb User : PoisonLam

本源码通过C# GDI+ 编写。提供三种生成迷宫的算法(深度优先法,递归分割法,随机PRIM法),提供基于广度优先算法的迷宫自动寻径算法。迷宫大小、单元格大小、线粗均可自定义。优化了算法,递归改为栈实现,能够生成任意大地图而不会引起原来的函数递归栈溢出问题。生成迷宫后,支持键盘按键进行手动走迷宫。(The source code is written by C# GDI+. Three algorithms of maze generation (depth first, recursion segmentation, random PRIM) are provided to provide a maze routing algorithm based on the breadth first algorithm. Maze size, cell size, line thickness can be customized. The algorithm is optimized and recursive to stack implementation. It can generate any large map without causing the recursive stack overflow problem of the original function. After creating the maze, support the keyboard button to manually walk the maze.)
Date : 2026-01-23 Size : 86kb User : sp_jiangjunling
CodeBus is one of the largest source code repositories on the Internet!
Contact us :
1999-2046 CodeBus All Rights Reserved.