Location:
Search - graph
Search list
Description: 在matlab中，生成复杂网络的随机图的两种策略-In matlab, the generation of random graph complex network of two strategies
Platform: |
Size: 1024 |
Author: susan |
Hits:
Description: Dijkstra算法，实现加权有向图中从确定的起点寻找最短路径并输出-Dijkstra algorithm, to achieve a weighted directed graph from the starting point to determine the shortest path to find and output
Platform: |
Size: 180224 |
Author: 曹雷 |
Hits:
Description: 旅行商算法，实现从加权有向图中寻找并输出最短的闭合路径-Traveling salesman algorithm, from a weighted directed graph to find and output the shortest path closure
Platform: |
Size: 179200 |
Author: 曹雷 |
Hits:
Description: 该文件是用matlab开发的图论分析工具箱，
里面有使用时的详细说明，pdf说明文档。
绝对实用对于图论的研究者-The document was developed with matlab graph theory analysis toolbox, which are used when a detailed explanation, pdf documentation. Absolutely useful for researchers in graph theory
Platform: |
Size: 63488 |
Author: 卫立波 |
Hits:
Description: 求二分图最大匹配 匈牙利算法-Seeking the maximum bipartite graph matching for bipartite graph maximum matching algorithm Hungary
Platform: |
Size: 1024 |
Author: 王琦 |
Hits:
Description: c++实现的有向图的临界矩阵构造，深度广度的遍历。-c++ achieved critical digraph matrix structure, depth, breadth Ergodic.
Platform: |
Size: 31744 |
Author: 小宋 |
Hits:
Description: 图的遍历 能实现深度 广度遍历
还有文挡-Graph traversal to realize the depth of breadth traversal also text block
Platform: |
Size: 4096 |
Author: 明明不是Angel |
Hits:
Description: 本程序实现图的深度优先和广度优先遍历，本程序调试无误，可在vc6.0环境中编译成功！-This procedure to achieve graph depth-first and breadth-first traversal, the program debugging accurate, can be successfully compiled vc6.0 environment!
Platform: |
Size: 1024 |
Author: 厘米怒 |
Hits:
Description: Delphi
梦幻西游刷经验
Gloal.dcu
Graph.dcu
Graph.pas
helper.dll
key.dcu
mainunit.dcu
mainunit.dfm
mainunit.pas
mh.JPG
Mouse.dcu
MPHP.dcu-Delphi Fantasy Westward Journey experience Brush Gloal.dcuGraph.dcuGraph.pashelper.dllkey.dcumainunit.dcumainunit.dfmmainunit.pasmh.JPGMouse.dcuMPHP.dcu
Platform: |
Size: 234496 |
Author: 夜客 |
Hits:
Description: 最短路径问题（用无向图表示n个城市之间的交通网络建设规划，顶点表示城市，边上的权表示该线路的造价，试设计一个方案，使得这个交通网的总造价最小。）-The shortest path problem (with undirected graph n cities that transport links between the construction plan, vertex, said city, said the right edge of the construction cost of the line and try to design a program, making the transport network of the total cost of the smallest.)
Platform: |
Size: 13312 |
Author: uliantong |
Hits:
Description: a molecular graph kernel based on iterative graph similarity and optimal assignments -a molecular graph kernel based on iterative graph similarity and optimal assignments
Platform: |
Size: 336896 |
Author: xz |
Hits:
Description: 这是关于图论的源代码和ppt的讲解，图论是一种非常经典的理论，运用也非常广泛。但是，图论的源代码写起来不是那么容易，这也就是为什么上传这个，方便大家。-This is on the graph theory ppt source code and explanations, graph theory is a very classical theory, the application is also very extensive. However, the graph theory to write the source code is not so easy, which is why From this, to facilitate everyone.
Platform: |
Size: 387072 |
Author: 吴建林 |
Hits:
Description: this a another graph cut and maxflow source-this is a another graph cut and maxflow source
Platform: |
Size: 684032 |
Author: oh |
Hits:
Description: This will calculate the shortest path of a graph-This will calculate the shortest path of a graph
Platform: |
Size: 68608 |
Author: chaminda |
Hits:
Description: 带权图的最短路径问题,主要介绍单源最短路径算法，最短路径问题的提法很多，其它的最短路径问题均可用单源最短路径算法予以解决-Weighted graph shortest path problem, mainly introduce single-source shortest path algorithm, the shortest path problem formulation of a lot of other shortest path problem can be used single-source shortest path algorithm to be addressed
Platform: |
Size: 3072 |
Author: sunshuquan |
Hits:
Description: 对Vladimir Kolmogorov，Yuri Boykov大牛的算法杰作——Graph Cut进行使用演示，代码力求精简，可供Graph Cut初学者参考学习。已通过VS2005编译。-Of Vladimir Kolmogorov, Yuri Boykov big cow masterpiece algorithm- Graph Cut for the use of demonstration, the code to be simple, for beginners Reference Graph Cut Study. VS2005 compiler has passed.
Platform: |
Size: 17408 |
Author: 杨金名 |
Hits:
Description: 基于图论的高效图像分割方法，比NCut算法的效率更高，效果更好-Based on Graph Theory and efficient image segmentation method, an algorithm NCut more efficient, better
Platform: |
Size: 391168 |
Author: 韩守东 |
Hits:
Description: Graph cut segmentationis is segment an image into two classes based on color.
Platform: |
Size: 27779072 |
Author: srikhan |
Hits:
Description: 多段图最短路径问题，求一个多段图源点到目的点的最短消耗-Multi-segment graph shortest path problem, and more than one paragraph map source to the destination point of the shortest consumption
Platform: |
Size: 1024 |
Author: 李加佳 |
Hits:
Description: Write a program to decide if a graph has a cycle or not. The given graph can be a directed or undirected graph, which is indicated at the time of reading the input (0 for directed graph and 1 for undirected graphs). The input is given as an adjacency list.
Platform: |
Size: 1024 |
Author: jazz |
Hits: