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写的源程序功能分别是1.用DFS算法判断有向图中是否有环2.从文件中读图，用邻接链表保存信息，寻找两个结点vi,vj间的最短路径-written in C source is a function respectively. DFS algorithm used to determine whether there are plans Central 2. Interpret drawings from the file, use the adjacent Chain preservation of information to find two nodes vi, vj the shortest path Platform: |
Size: 3072 |
Author:光光 |
Hits:
Description: 我的算法作业，求一个在总花费小于1500的条件下从源结点到目的结点的最短路径，源代码Tree.cpp（C++语言编写，VC++6.0 IDE下调试通过），利用的是分支定界算法。可执行文件Tree.exe说明在ReadMeFirst请按照说明使用。-algorithm operations, for a total cost of less than 1,500 from the source node to node purpose of the shortest path, Tree.cpp source code (written in C, Visual C++ 6.0 IDE debug through), use of the branch-and-bound algorithm. Note executable file Tree.exe in ReadMeFirst follow the instructions to use. Platform: |
Size: 30720 |
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.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: 图论算法库 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: A*（A-Star)算法是一种静态路网中求解最短路最有效的方法。
公式表示为： f(n)=g(n)+h(n),
其中f(n) 是节点n从初始点到目标点的估价函数，
g(n) 是在状态空间中从初始节点到n节点的实际代价，
h(n)是从n到目标节点最佳路径的估计代价。
-A* (A-Star) algorithm is a static network shortest path in solving the most effective way. Formula is expressed as: f (n) = g (n)+ H (n), in which f (n) is a node n from the initial point to the target point of the valuation function, g (n) in state space from the initial node to node n of the actual cost, h (n) from n to the target node of the estimated cost of the best path. Platform: |
Size: 13312 |
Author:朱宝三 |
Hits:
Description: 对于无向图或有向图，程序可以计算出图中每两个顶点之间的最短路径，并列出Floyd算法的具体实现-For undirected graph or directed graph, the program can calculate a figure between every two vertices of the shortest path, and lists the specific realize Floyd algorithm Platform: |
Size: 192512 |
Author:王海涛 |
Hits:
Description: 此程序是我在作毕业设计时做的在c#环境下，用于dijkstra最短路径算法的实现，程序相当完美，希望能为大家提供便利。-This program is my design to do for graduation in the c# Environment Dijkstra shortest path algorithm for the realization process is perfect, hope to be able to facilitate everyone. Platform: |
Size: 16384 |
Author:zzbzzb |
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: 单源最短路径问题：给定带权有向图G=(V,E)。给定V中的一个顶点v，称为源。要计算从源到所有其它各顶点的最短路径长度。-Single-source shortest path problem: a given weighted directed graph G = (V, E). Given a vertex V in v, known as the source. To calculate from the source to all other vertices of the shortest path length. Platform: |
Size: 1024 |
Author:忠波 |
Hits:
Description: 原创，A-star算法求解最短路径，寻路问题。
求解效率高，且对于理解A-Star算法和数据结构链表操作有非常有用。-Original, A-star algorithm for solving the shortest path routing problem. Solving high efficiency, and for understanding the A-Star algorithm and data structure linked list has a very useful operation. Platform: |
Size: 2048 |
Author:lys |
Hits:
Description: 如何找到一条最短的路径是程序员需要设计的算法，目前最为流行的寻路算法就是A*算法，这个就是A*算法的一个简单例子-How to find a shortest path is programmers need to design algorithms, is currently the most popular routing algorithm is the A* algorithm, this is the A* algorithm is a simple example Platform: |
Size: 326656 |
Author:cn |
Hits:
Description: 计算机算法中的最短单源路径算法的C程序
它实现了求取最短路径-Computer algorithms in the single-source shortest path algorithm of C procedures it has to strike a shortest path Platform: |
Size: 1024 |
Author:张飞扬 |
Hits:
Description: 一个遗传算法求解两点最短路径问题的具体实现，采用C++编写，经测试当求解路径较复杂时，其算法执行效率高于dijstra算法-A genetic algorithm for two concrete realization of the shortest path problem, using C++ written in the path have been tested when solving more complex, its algorithm is more efficient than the implementation of algorithms dijstra Platform: |
Size: 465920 |
Author:wangrenbiao |
Hits:
Description: Dijkstra的算法的c++小程序演示解决的最短路径的问题,希望对大家有用-Dijkstra' s Algorithm in c++ small program demonstrates the shortest path to solve the problem, we want to be useful Platform: |
Size: 533504 |
Author:王鹏 |
Hits:
Description: 算法简述：A星路径搜索(采用二叉堆)，最短路径寻路算法-Algorithm Description: A star path search (using the binary heap), the shortest path Algorithm for Route Platform: |
Size: 51200 |
Author:zhongkeli |
Hits:
Description: floyd算法，最短路径C语言算法实现，acm最短路径问题-floyd algorithm, the shortest path algorithm in C language to achieve, acm shortest path problem Platform: |
Size: 1024 |
Author:lvbei |
Hits:
Description: 图论算法在计算机科学中扮演着很重要的角色，它提供了对很多问题都有效的一种简单而系统的建模方式。很多问题都可以转化为图论问题，然后用图论的基本算法加以解决。遗传算法是解优化问题的有效算法，而并行遗传算法是遗传算法研究中的一个重要方向，受到了研究人员的高度重视。(Graph theory plays an important role in computer science. It provides a simple and systematic modeling method for many problems. Many problems can be translated into graph theory problems, and then solved by the basic algorithm of graph theory. Genetic algorithm is an efficient algorithm for solving optimization problems, and parallel genetic algorithm is an important direction of genetic algorithm research, and has attracted much attention of researchers.) Platform: |
Size: 27648 |
Author:四姑娘
|
Hits:
Search - shortest path algorithm in c