Location:
Search - 图论
Search list
Description: 这是一本图论算法的经典之作
Platform: |
Size: 5240398 |
Author: xiaohuang_17 |
Hits:
Description: 包括多个关于matlab图论程序
Platform: |
Size: 32871 |
Author: czkoca |
Hits:
Description: 图论的matlab工具箱 非常详细
Platform: |
Size: 57405 |
Author: prometheus |
Hits:
Description: acm 图论算法
Platform: |
Size: 134144 |
Author: cout0526 |
Hits:
Description: 图论模型的各种算法的集合
Platform: |
Size: 161280 |
Author: yahsue |
Hits:
Description: 图论的算法与程序设计-graph theory of algorithms and program design
Platform: |
Size: 5309440 |
Author: 站长 |
Hits:
Description: 10组图论编程，自篇只做参考，望您看后帮助修改-programming, since the only reference to chapter, you do look after the changes help
Platform: |
Size: 5120 |
Author: 罗军 |
Hits:
Description: 此书详细的介绍了各种流行和重要的图算法 识货的就下咯-book detailed account of a popular and important map know the quality of the algorithm on the basis of 1,10
Platform: |
Size: 5239808 |
Author: 喻林 |
Hits:
Description: BFS、DFS、有向图、无向图中的各种算法的实现，可以自动生成图形。-BFS, DFS, to the map, no map to the realization of the algorithm can be automatically generated graphics.
Platform: |
Size: 119808 |
Author: 李想 |
Hits:
Description: 图论课程设计：在无向完全图中寻找边不重复的汉密尔顿回路-graph theory of curriculum design : no plans to seek full side will not repeat the Hamilton circuit
Platform: |
Size: 20480 |
Author: ch.nan |
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: 求通过回溯算法遍历图中所有的路径求得a到b的最短距离(Seeking through backtracking algorithm traversal of all the paths in the path to obtain the shortest distance from A to B)
Platform: |
Size: 1024 |
Author: lhbren
|
Hits:
Description: 运用LINGO解决一些经典的图论问题，附程序(Solutions to some issues related with graph theory in virtue of LINGO(program included))
Platform: |
Size: 131072 |
Author: Infini
|
Hits:
Description: 图论模型解决最短路径问题的matlab代码(Graph theory model to solve the shortest path problem matlab code)
Platform: |
Size: 440320 |
Author: 呀呀0414
|
Hits:
Description: 介绍图论中的弗洛伊德算法求解最短路径问题(This paper introduces the Freud algorithm in graph theory to solve the shortest path problem)
Platform: |
Size: 337920 |
Author: 呀呀0414
|
Hits:
Description: 针对图着色问题所用的一种敏感图论算法，解决路线着色问题。(A sensitive graph theory algorithm for graph coloring problem is used to solve the problem of route coloring.)
Platform: |
Size: 521216 |
Author: Fighting、
|
Hits:
Description: 内涵图论讲解及Dijesktra，Floyd等算法的Matlab程序(Dijesktra and Floyd algorithm)
Platform: |
Size: 494592 |
Author: KyungChulK
|
Hits:
Description: 图论问题 图的建立 图由顶点的集合和顶点间关系的集合组成。
图有无向图和有向图之分。
图的边上加上权值后为带权图。
度是与顶点相连的边的数目，有向图分入度和出度。
连通图指图中任意两个顶点都是连通的。6无向图和有向图(The problem of graph theory)
Platform: |
Size: 2048 |
Author: 西贝轩 |
Hits:
Description: 常用图论算法及其MATLAB程序代码：
1.最短路的Warshall-Floyd算法
2.最小生成树Kruskal避圈法
3.二部图G的最大匹配的算法(匈牙利算法)(The commonly used graph theory algorithm and its MATLAB program code:
1. shortest path Warshall-Floyd algorithm
2. minimum spanning tree Kruskal avoidance method
3. the maximum matching algorithm of the two part graph G (Hungary algorithm))
Platform: |
Size: 37888 |
Author: 解码 |
Hits:
Description: 本书系统介绍了图论重要算法的思想及其 MATLAB实现，可供数学、计算机科学、工程科学等学科中相关专业的大学生、研究生阅读,也可供相关专 业研究人员参考。(This book systematically introduces the idea of the important algorithm of graph theory and its MATLAB implementation, which can be read by college students and graduate students majoring in mathematics, computer science, engineering science and other disciplines, and can also be referred to by researchers specializing in related fields.)
Platform: |
Size: 1220608 |
Author: axmlx |
Hits:
« 12
3
4
5
6
7
8
9
10
...
50
»