Description: 图论算法库 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 Platform: |
Size: 10202 |
Author:罗鹏魁 |
Hits:
Description: Prim 算法寻找最小生成树，用C语言实现，有完整的注释！-Prim algorithm to find the minimum spanning tree, using C language, a complete Notes! Platform: |
Size: 1024 |
Author:gao |
Hits:
Description: 图论算法库 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 Platform: |
Size: 10240 |
Author:罗鹏魁 |
Hits:
Description: 最大流量Prim 算法寻找最小生成树,用C语言实现,有完整的注释-maximum flow Prim finding minimum spanning tree algorithm, using C language, a complete Notes Platform: |
Size: 1024 |
Author:DoDoggy |
Hits:
Description: 图论算法库 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 theory is the C language code as graph theory algorithm library, including the following algorithm : single source Dijkstra shortest path algorithm for single-source shortest path Bellman-Ford algorithm youngest generation Prim algorithm for each tree node on the shortest path between Flod- Warshall algorithm language C compiler platform Vi sualAge author starfish 4.0 C (starfish.h @ china.c om) Remarks procedures using C language, VisualAge C 4.0 debugging through. The compressed file contains Graph.h all library functions, procedures call interface see Notes. Other documents are used to test the algorithm testing procedures, the VisualAge C compiler running under 4.0. The algorithm is to participate in the ACM/ICPC contest and the preparation of information, because the competit Platform: |
Size: 4096 |
Author: |
Hits:
Description: 1）掌握图的邻接矩阵存储结构表示和与图创建算法的c语言实现；
2）掌握普里姆（Prim）最小生成树算法(P174:算法7.9)的C语言实现及应用；
3）验证如下图5-1所示无向网的最小生成树的正确性
4）按照实验题目要求独立正确地完成实验内容（提交程序清单及相关实验数据与运行结果）；
-1) The master plan of the adjacency matrix and the storage structure that plans to create algorithm c language 2) master prim (Prim) Minimum Spanning Tree Algorithm (P174: Algorithm 7.9) of the C language and application 3) the certification is as follows shown in Figure 5-1 undirected minimum spanning tree network, the accuracy of 4) in accordance with the experimental subject for independent completion of the experiment the contents of the right (to submit the list of procedures and related experimental data and results) Platform: |
Size: 109568 |
Author:滨 |
Hits:
Description: 图论算法库 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. Platform: |
Size: 1024 |
Author:王兵 |
Hits:
Description: 普里姆算法，求图的最小生成树问题。用的是C语言，比书上的详细。-Prim algorithm, and the minimum spanning tree problem Fig. Using the C language, the detailed than the book. Platform: |
Size: 1024 |
Author:熊龙龙 |
Hits:
Description: C语言实现普里姆算法 根据无向网构造最小生成树-C language implementation Prim algorithm based on minimum spanning tree in undirected network structure Platform: |
Size: 2048 |
Author:xiyangyang |
Hits:
Description: 用prim算法求最小生成树.C语言中关于图一章的很好的理解例子。对初学者很有用。-Seek the minimum spanning tree with the prim algorithm. C language on the map a good understanding of the chapter examples. Very useful for beginners. Platform: |
Size: 272384 |
Author:肖叶枝 |
Hits:
Description: 本程序是用c语言来编程实现Prim算法，希望对别人有帮助！-This procedure is used c programming language Prim algorithm, we want to help others! Platform: |
Size: 1024 |
Author:代伟 |
Hits:
Description: 用C语言编写的最小生成树的改进普林算法，可以从任意节点开始生成最小生成树-Written in C language, Princeton improved minimum spanning tree algorithm, starting from any node to generate the minimum spanning tree Platform: |
Size: 11264 |
Author:zhuxuedandan |
Hits:
Description: Prim算法的C语言实现，构造连通图，寻找N个点的最短路径。-Prim algorithm C language implementation of connected graph structure, looking for N point of the shortest path. Platform: |
Size: 1024 |
Author:木龙 |
Hits:
Description: 最小生成树算法，利用c语言编写，用vc++运行即可-Minimum spanning tree algorithm, using c language, can be run using vc++ Platform: |
Size: 1024 |
Author:张飞 |
Hits:
Search - prim algorithm c language