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: 4275 |
Author:kelly |
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: 图论算法库 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: 本压缩包包括matlab的顶点覆盖近似算法、哈密尔顿回路、模拟退火应用、最大流和最小截、最短路和次短路、最短路径、最小生成树prim算法等，带有源程序和中文说明文档，此文件夹中的文件，如需被利用，则要直接放至work目录下。-The compressed packet including matlab vertex cover approximation algorithm, Hamilton circuit, simulated annealing, maximum flow and minimum cross-sectional, short-circuit and times of short-circuit, the shortest path, minimum spanning tree prim algorithm with source code and Chinese documentation, thisfile folder for use, will have to be placed directly under the work directory. Platform: |
Size: 47104 |
Author:吴自强 |
Hits:
Description: 本工程包含二叉树和图的相关基本操作，源码包括二叉树的前序、中序、后序、层次遍历，求树高和树宽，创建、删除二叉树或某个结点，通过前序和中序序列得后序序列；图的创建（邻接矩阵或邻接表表示），深度优先和广度优先搜索，求关键路径，普里姆算法求最小生成树等，放到Visual C++工作区即可使用。(This project contains the basic operation of the binary tree and the graph. The source code includes the preorder, inorder, postorder, level traversal of the binary tree, tree height and tree width, create and delete binary tree or a node, through the preface and inorder sequence create postorder sequence; graph creation(the adjacency matrix or adjacency list representation), depth-first and breadth-first search, find the critical path, and find the minimum spanning tree based on the Prim algorithm, all of which can be used in the Visual C ++ workspace.) Platform: |
Size: 1800192 |
Author:太阳倘若失眠
|
Hits:
Description: 本源码通过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.) Platform: |
Size: 88064 |
Author:sp_jiangjunling |
Hits:
Search - source code of prim algorithm