文件名称:图论算法库 C++ 语言实现
介绍说明－－下载内容均来自于网络，请自行研究使用
图论算法库 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
代码内容 图论算法库，包括以下算法：
单源最短路径 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
(系统自动生成,下载前可以参看下载内容)
下载文件列表
图论
....\BALL.CPP
....\BALL.IN
....\BALL.OUT
....\Bellman_Ford.cpp
....\Bellman_Ford.icc
....\Bellman_Ford.in
....\Bellman_Ford.irs
....\Bellman_Ford.out
....\Dijkstra.cpp
....\Dijkstra.icc
....\Dijkstra.in
....\Dijkstra.out
....\Floyd_Warshall.in
....\Floyd_Warshall.out
....\Folyd_Warshall.cpp
....\Folyd_Warshall.icc
....\GRAPH.H
....\MainFrame.cpp
....\Prim.cpp
....\PRIM.ICC
....\PRIM.IN
....\Prim.out
....\BALL.CPP
....\BALL.IN
....\BALL.OUT
....\Bellman_Ford.cpp
....\Bellman_Ford.icc
....\Bellman_Ford.in
....\Bellman_Ford.irs
....\Bellman_Ford.out
....\Dijkstra.cpp
....\Dijkstra.icc
....\Dijkstra.in
....\Dijkstra.out
....\Floyd_Warshall.in
....\Floyd_Warshall.out
....\Folyd_Warshall.cpp
....\Folyd_Warshall.icc
....\GRAPH.H
....\MainFrame.cpp
....\Prim.cpp
....\PRIM.ICC
....\PRIM.IN
....\Prim.out