Search - source algorithm prim

Search - source algorithm prim - List

[Data structs] Prim_gao DL : 0: Prim 算法寻找最小生成树，用C语言实现，有完整的注释！-Prim algorithm to find the minimum spanning tree, using C language, a complete Notes!
Date : 2025-12-24 Size : 1kb User : gao
[Data structs] 图论算法库 C++ 语言实现 DL : 0: 图论算法库 C++ 语言实现代码内容图论算法库，包括以下算法：单源最短路径 Dijkstra 算法单源最短路径 Bellman-Ford 算法最小生成树 Prim 算法每对节点间最短路径 Flod-Warshall 算法语言 C++ 编译平台 VisualAge C++ 4.0 作者 starfish (starfish.h@china.com) 备注程序用C++语言编写，在VisualAge C++ 4.0下调试通过。压缩包内的Graph.h文件包含所有的库函数，其调用接口见程序内注释。其他的文件是用来测试算法的测试程序，在VisualAge C++ 4.0下编译运行。该算法是我为参加ACM/ICPC竞赛而准备的资料，由于竞赛的对编程速度要求较高，所以为了将代码写的短一点，为了便于调试，代码的写的并不是最优的。虽然该代码在VisualAge C++ 4.0下写成，但是很容易将其移植到MS Visual C++上。 -graph algorithm for C language code content graph algorithm library, including the following algorithm : single-source shortest path algorithm Dijkstra single source shortest path Bellman-Ford algorithm youngest generation Prim algorithm for each tree node on the shortest path between Flod- Warshall ALGOL C compiler platform Vi sualAge author starfish 4.0 C (starfish.h @ china.c om) Remarks procedures using C language, the VisualAge C 4.0 debugging through. The compressed file contains all Graph.h the library, the procedure call interface, see the Notes. Other documents algorithm is used to test the test procedures in VisualAge C compiler running under 4.0. The algorithm is for me to participate in ACM/Illinois prepared to contest the information, because the competition for high speed
Date : 2025-12-24 Size : 10kb User : 罗鹏魁
[Data structs] aa DL : 0: 图论算法库 C++ 语言实现代码内容图论算法库，包括以下算法：单源最短路径 Dijkstra 算法单源最短路径 Bellman-Ford 算法最小生成树 Prim 算法每对节点间最短路径 Flod-Warshall 算法语言 C++ 编译平台 VisualAge C++ 4.0 作者 starfish (starfish.h@china.com) 备注程序用C++语言编写，在VisualAge C++ 4.0下调试通过。-Graph Theory Algorithm Library C++ Language code realize the contents of graph theory algorithm library, which includes the following algorithms: single-source shortest path Dijkstra algorithm for single-source shortest path Bellman-Ford algorithm Prim minimum spanning tree algorithm between each pair of nodes Flod-Warshall shortest path algorithm Language C++ compiler platform VisualAge C++ 4.0 Author starfish (starfish.h @ china.com) Remarks procedures used C++ language in VisualAge C++ 4.0 debugging through.
Date : 2025-12-24 Size : 1kb User : 王兵
[Data structs] prim DL : 0: 本源码可供数据结构的初学者借鉴，叫最小生成树prim算法-The source for the data structure from the beginners, called minimum spanning tree algorithm prim
Date : 2025-12-24 Size : 7kb User : 郑海洋
[Data structs] yuandaima DL : 0: 一般背包问题的贪心算法 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
Date : 2025-12-24 Size : 7kb User : liujuan
[Data structs] UnDirectGraph DL : 0: 本程序实现了《数据结构》课本中无向图的基本算法，包括图的构造、图的深度、广度优先遍历算法、用Prim、Kruskal算法构造最小生成树以及分别用Dijkstra、Floyd算法求源点到所有顶点、图中任意两点间的最短路径，并给出具体的路径 -This procedure achieved a " data structure" textbooks undirected graph the basic algorithm, including graphs, graph depth, breadth-first traversal algorithm, Prim, Kruskal minimum spanning tree construction algorithm and were used Dijkstra, Floyd algorithm to solve the source to all vertices of the graph the shortest path between any two points, and gives a specific path
Date : 2025-12-24 Size : 39kb User : 王广友
[Data structs] greedy DL : 0: 这是算法设计与分析课程实验，贪心算法实验的简单的源代码，包括汽车加油，多级调度问题，prim最小生成树-This is the algorithm design and analysis course experiment, the experiment simple greedy algorithm source code, including vehicle refueling, multi-level scheduling problem, prim MST
Date : 2025-12-24 Size : 2kb User : 林达
[Data structs] prim DL : 0: 数据结构普里姆算法构造最小生成树的源代码-Construct data structures prim minimum spanning tree algorithm source code
Date : 2025-12-24 Size : 1kb User : 余地
[Data structs] data-structure-Graph DL : 1: 本软件围绕无向图的应用这一主题，用图形化的界面实现了无向图的建立、显示邻接表、动态构造最小生成树（分别利用Prim算法和Kruscal算法）、查找最短路径等功能。具体功能：给定一个图，完成：（1）建立并显示出它的邻接链表（2）分别用普里姆算法和克鲁斯卡尔算法构造其最小生成树，随时显示其构造的过程（3）给出某一确定顶点到所有其他顶点的最短路径（4）给出每一对顶点之间的最短路径说明：程序开发时所用的文件和源码在文件夹“配套文件”中提供。另附说明文档。-This software around the theme of directed graph, use the graphical interface to achieve the establishment of an undirected graph, showing the adjacent table, the dynamic construction of minimum spanning tree (Prim algorithm and Kruscal algorithm), find the shortest path. Specific features: Given a graph, complete: (1) to establish and demonstrate its adjacency lists (2) the algorithm of Prim and Kruskal algorithm construct the minimum spanning tree, ready to show the process of its construction (3) gives the shortest path to determine a vertex to all other vertices (4) gives the shortest path between each pair of vertices Description: used in program development and source files in the folder "supporting documents". Attach a separate sheet document.
Date : 2025-12-24 Size : 2.91mb User : lsc
[Data structs] minimum-spanning-tree DL : 0: 使用C#图形界面生成最小生成树，核心算法使用Prim算法。图的形状可以在源文件中的图定义处修改。-C# graphical interface to generate a minimum spanning tree, the core algorithm using Prim algorithm. The graph shape defined in the source file in Figure modify.
Date : 2025-12-24 Size : 44kb User : 黄佳禾
[Data structs] prim DL : 0: 数据结构课上prim算法的源程序。数据结构课上prim算法的源程序。数据结构课上prim算法的源程序。-Class data structure prim algorithm of the source. Class data structure prim algorithm of the source.
Date : 2025-12-24 Size : 164kb User : Yang
[Data structs] Floyed-Huffman-prim DL : 0: 算法设计与分析课程中常用的一些算法，包括Floyed算法，Huffman算法、prim算法，单源最短路径算法，分数背包问题-Algorithm Design and Analysis course some commonly used algorithms, including Floyed algorithm, Huffman algorithm, prim algorithm, single-source shortest path algorithm, fractional knapsack problem
Date : 2025-12-24 Size : 528kb User : liyuqin