Description: 本程序是利用Ford和Fulkerson迭加算法,求最小费用最大流-use of this procedure is superposition Ford and Fulkerson algorithm, the minimum cost for maximum flow Platform: |
Size: 2703 |
Author:李平 |
Hits:
Description: 本程序是利用Ford和Fulkerson迭加算法,求最小费用最大流-use of this procedure is superposition Ford and Fulkerson algorithm, the minimum cost for maximum flow Platform: |
Size: 2048 |
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: 这是William Ford,William Topp编写,刘卫东译,严蔚敏审校的数据结构 C++语言描述电子书籍。-This is the William Ford, William Topp prepared, translated Liu, Yan Wei-min data structure Revisers C++ Language to describe e-books. Platform: |
Size: 20141056 |
Author:刘名 |
Hits:
Description: 用c++实现ford算法实现求含负权边最短路径-With c++ Achieve ford algorithm for the right to contain the negative side of the shortest path Platform: |
Size: 1024 |
Author:wangyu07 |
Hits:
Description: Description of Ford Fulkerson´ s method in C-Description of Ford Fulkerson´ s method in C++ Platform: |
Size: 7168 |
Author:ns |
Hits:
Description: ford-fulkerson算法的具体实现。实现了最大流算法。编程语言c-ford-fulkerson algorithm implementation. To achieve the maximum flow algorithm. C++ programming language Platform: |
Size: 4096 |
Author:林选伟 |
Hits:
Description: C语言编写的,用标号算法解决最大流问题,文件中有例子和结果,适合初学者学习使用。-Written in C language, with Ford-Fulkerson algorithm to solve the problem, a file with examples and results, suitable for beginners learning to use.
Platform: |
Size: 19456 |
Author:谱算法 |
Hits: