Location:
Search - Graph Theory
Search list
Description: 图论中使用分支与界法求解旅行商问题，直接在vc中编译可运行-graph theory with the use of branch and bound for traveling salesman problem, which directly vc compiler can run
Platform: |
Size: 2048 |
Author: 谢继晖 |
Hits:
Description: 用模拟退火法高效的计算图论中哈密顿贿赂的最短路径-simulated annealing method of calculating efficient graph theory Hamiltonian bribery Shortest Path
Platform: |
Size: 2048 |
Author: 孙兵 |
Hits:
Description: 一篇很全的图论知识的概论，很适合初学者观看-a very full knowledge of graph theory to the Introduction, which is perfect for beginners to watch
Platform: |
Size: 591872 |
Author: sunnie |
Hits:
Description: “八皇后”问题归朔法求解。八皇后问题是一个古老而著名的问题，该问题是十九世纪著名的数学家高斯1850年提出：在8X8格的国际象棋上摆放八个皇后，使其不能互相攻击，即任意两个皇后都不能处于同一行、同一列或同一斜线上，问有多少种摆法。 高斯认为有76种方案。1854年在柏林的象棋杂志上不同的作者发表了40种不同的解，后来有人用图论的方法解出92种结果。-"8 Queen" The problem Schomburg method. 8 Queen's problem is an ancient and famous, the problem is the famous 19th century mathematician Gauss 1850 : in the 8x8 grid placed on the international chess 8 Queen's, making it unable to attack each other. that is arbitrary two Queens are not at the same trip, the same series or in the same slash and asked how many pendulum. Gaussian that 76 species program. In 1854 in Berlin on different chess magazine published by the author of 40 different solutions, Later, someone using graph theory methods to come up with 92 kinds of results.
Platform: |
Size: 162816 |
Author: yefeng |
Hits:
Description: c++常用算法集,包含数据结构,图论等成熟经典算法-c commonly used algorithm set includes data structures, graph theory, and other mature classical algorithm
Platform: |
Size: 319488 |
Author: 李才 |
Hits:
Description: 欧拉图的使用，和它的源码，还有欧拉图的原理和解释，希望大家能用到-Graphs use, and its source code, there is a graph theory and explained that the hope that everyone can be
Platform: |
Size: 4096 |
Author: 赵寰 |
Hits:
Description: 解决多商旅问题的一个源程序,对图论的处理比较有借借鉴意义-solve problems and countless more a source of graph theory can be used in handling more Significance
Platform: |
Size: 1024 |
Author: 吕明洲 |
Hits:
Description: 用matlab求解图论中最大截问题，带有例子，简洁可靠。-Using matlab to solve the biggest cut in graph theory problem, with examples, simple and reliable.
Platform: |
Size: 1024 |
Author: 枫 |
Hits:
Description: 一本非常好的图论与网络的书籍，是进行图论或复杂网络研究的同仁们必备的一本书-A very good graph theory and network books, is a complex network graph theory or the study of Tongren a must-have book
Platform: |
Size: 5442560 |
Author: 王羡霏 |
Hits:
Description: 解决图论中Warshall-Floyd 算法，Kruskal 避圈法，匈牙利算法，求最佳匹配的算法，求最大流的Ford--Fulkerson 标号算法，求解最小费用流问题的matlab程序-Solve the graph theory Warshall-Floyd algorithm, Kruskal avoid lap law, Hungary algorithm, and the best matching algorithm, for maximum flow of the Ford- Fulkerson labeling algorithm for solving the minimum cost flow problem of matlab procedures
Platform: |
Size: 47104 |
Author: yangfei |
Hits:
Description: 网络流算法
涉及：数据结构(图论)、算法、ACM
分类有最大流、最小费用最大流、最小割-Network flow algorithm involving: data structures (graph theory), algorithm, ACM classification has maximum flow, minimum cost maximum flow, minimum cut
Platform: |
Size: 91136 |
Author: sql |
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: 图论算法中dijkstra、Floy、和最小生成树算法的实现，使用类进行封装-Graph theory algorithm dijkstra, Floy, and the minimum spanning tree algorithm, the use of encapsulation
Platform: |
Size: 173056 |
Author: 林立文 |
Hits:
Description: 图论算法库，包括以下算法：
单源最短路径 Dijkstra 算法
单源最短路径 Bellman-Ford 算法
最小生成树 Prim 算法
每对节点间最短路径 Flod-Warshall 算法
程序用C++语言编写，在VisualAge C++ 4.0下调试通过。压缩包内的Graph.h文件包含所有的库函数，其调用接口见程序内注释。其他的文件是用来测试算法的测试程序，在VisualAge C++ 4.0下编译运行。
该算法是为参加ACM/ICPC竞赛而准备的资料，由于竞赛的对编程速度要求较高，所以为了将代码写的短一点，为了便于调试，代码的写的并不是最优的。
该代码在VisualAge C++ 4.0下写成，但是很容易将其移植到MS Visual C++上。
-err
Platform: |
Size: 10240 |
Author: lllstar |
Hits:
Description: graph theory with applications to engineering
Platform: |
Size: 4576256 |
Author: omyazan |
Hits:
Description: 图论的算法，最短路，最小生成树，连通，匹配，网络流及应用。-Graph theory, algorithms, shortest path, minimum spanning tree, connectivity, matching, network flow and applications.
Platform: |
Size: 39936 |
Author: young |
Hits:
Description: 非常好的图论学习教材，可作为数学专业的本科教材(graph theory and combinatics)
Platform: |
Size: 3372032 |
Author: 纪夕颜
|
Hits:
Description: 图论应用的说明理论。本书能教予我们如何应用图论的基础去编程，去作为每个数据结构的框架。(Explanation theory of graph theory application.This book teaches us how to apply graph theory as a basis for programming as a framework for each data structure.)
Platform: |
Size: 7320576 |
Author: kkburp
|
Hits:
Description: 高随祥的图论与网络流理论，介绍在网络里如何利用图论进行问题的分析，对于庞大的网络流有相当的帮助。(Gao Suixiang's graph theory and network flow theory, introduced in the network how to use graph theory to analyze the problem, for a large network flow quite helpful.)
Platform: |
Size: 78843904 |
Author: kkburp
|
Hits:
Description: Coursera Graph Theory Course .. assignments' solutions to pass the course in cplus plus
Platform: |
Size: 8586 |
Author: sigsegv22 |
Hits:
« 12
3
4
5
6
7
8
9
10
...
46
»