搜索资源列表
SouceCode1_Source
- graph cut for itk. It uses a-expansion. Must install itk first and run with itk.
LGE
- LGE算法（Linear Graph Embedding）用于降维，代码比较长，比较复杂。供大家研究！-LGE algorithm (Linear Graph Embedding) for dimensionality reduction, code longer, more complicated. For everyone!
OLPP
- 正交的Linear Graph Embedding算法！用于降维，供大家学习交流。-Orthogonal Linear Graph Embedding Algorithm! For dimensionality reduction for them to learn from the exchange.
KrusKal
- 对一个带权无向图，求其最小生成树，本程序功能通过KrusKal算法实现。-Of a weighted undirected graph, and its minimum spanning tree, the program features through the Kruskal algorithm.
networkandgraph
- network and graph optimal algrithom classic book
graph
- 可实现坐标平台显示功能，X Y 坐标可调，界面可拉伸-Platform enables display coordinates, XY coordinates adjustable interface tensile
GraphEditor3.3
- 图形界面,创建图形,连接图形,删除图形的基本框架-Graphical interface, create graphics, connected graph, delete the basic framework of graphics
Dijkstra
- Dijkstra算法，实现加权有向图中从确定的起点寻找最短路径并输出-Dijkstra algorithm, to achieve a weighted directed graph from the starting point to determine the shortest path to find and output
TravellingSalesman
- 旅行商算法，实现从加权有向图中寻找并输出最短的闭合路径-Traveling salesman algorithm, from a weighted directed graph to find and output the shortest path closure
graphAnalysis
- 该文件是用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
hgr
- 求二分图最大匹配 匈牙利算法-Seeking the maximum bipartite graph matching for bipartite graph maximum matching algorithm Hungary
graph
- c++实现的有向图的临界矩阵构造，深度广度的遍历。-c++ achieved critical digraph matrix structure, depth, breadth Ergodic.
graph
- 图的遍历 能实现深度 广度遍历 还有文挡-Graph traversal to realize the depth of breadth traversal also text block
Graph
- 本程序实现图的深度优先和广度优先遍历，本程序调试无误，可在vc6.0环境中编译成功！-This procedure to achieve graph depth-first and breadth-first traversal, the program debugging accurate, can be successfully compiled vc6.0 environment!
123222
- 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.dcumain
lujin
- 最短路径问题（用无向图表示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
GraphTheory
- 这是关于图论的源代码和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 wr
implementation_bensch
- this a another graph cut and maxflow source-this is a another graph cut and maxflow source
DataStructTest
- This will calculate the shortest path of a graph-This will calculate the shortest path of a graph
GraphCut
- 对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