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: 对于搞ACM/ICPC有很大帮助,里面涉及博弈论，图论，矩阵，计算几何，状态压缩等算法思想的描述。-To engage in ACM/ICPC great help, which involves game theory, graph theory, matrices, computational geometry, state compression algorithm described ideas. Platform: |
Size: 8453120 |
Author:王小恒 |
Hits:
Description: 学校内部的ICPC/ACM大赛培训的源码，文件包括几何数学，组合数学，图论等常用算法的实现-Schools within the ICPC/ACM contest training source, the file including geometry mathematics, combinatorics, graph theory and other commonly used Algorithm Platform: |
Size: 81920 |
Author:zrOOrz |
Hits:
Description: ACM/ICPC经典算法的代码，包括数论、图论、数值计算、组合、几何等几方面，很适合算法爱好者-ACM/ICPC classical algorithm code, including number theory, graph theory, numerical calculation, combination, geometry and other aspects, it is suitable algorithm lovers Platform: |
Size: 69632 |
Author: |
Hits:
Description: 算法竞赛入门经典（第二版） (算法艺术与信息学竞赛)
2014年6月第一次印刷
《算法竞赛入门经典(第二版)》是一本算法竞赛的入门与提高教材，把c/c++语言、算法和解题有机地结合在一起，淡化理论，注重学习方法和实践技巧。全书内容分为12 章，包括程序设计入门、循环结构程序设计、数组和字符串、函数和递归、c++与stl入门、数据结构基础、暴力求解法、高效算法设计、动态规划初步、数学概念与方法、图论模型与算法、高级专题等内容，覆盖了算法竞赛入门和提高所需的主要知识点，并含有大量例题和习题。书中的代码规范、简洁、易懂，不仅能帮助读者理解算法原理，还能教会读者很多实用的编程技巧；书中包含的各种开发、测试和调试技巧也是传统的语言、算法类书籍中难以见到的。
《算法竞赛入门经典(第二版)》可作为全国青少年信息学奥林匹克联赛（noip）复赛教材、全国青少年信息学奥林匹克竞赛（noi）和acm国际大学生程序设计竞赛（acm/icpc）的训练资料，也可作为it工程师与科研人员的参考用书。-Introduction to Algorithms (Second Edition) (algorithm art and informatics competition)
First printed in June 2014
Introduction to the classic algorithm (Second Edition) is an entry and improvement of teaching materials, the c/c++ language, algorithms and problem-solving organically combined together, dilute theory, focus on learning methods and practical skills. The book is divided into 12 chapters, including the introduction of program design, program design, cycle structure, function and recursive arrays and strings, c++ and STL entry, basis, method and data structure of violence efficient algorithm design, dynamic programming, preliminary mathematical concepts and methods, graph theory model and algorithm, advanced contents, main knowledge points cover the required entry and improve the competition algorithm, and contains a large number of examples and exercises. In the book, the code is simple and easy to understand, not only can help the reader understand the principle of the a Platform: |
Size: 9708544 |
Author:张甲林 |
Hits:
Search - graph theory algorithm ICPC