搜索资源列表
Graph
- 图形学上机实验代码，算法经过仔细推敲，为最优算法-Graphics on the machine test code, algorithms careful scrutiny, as the optimal algorithm
visibility_graph_robot_motion
- visibility graph code developed on matlab, which uses astar search algorithm and minkowski difference - developed and updated from the previosly uploaded java source code
fenshuilingsuanfa
- 基于分水岭算法和图论的图像分割，所使用的方法为分水岭算法和Normalized Cut方法-Based on watershed algorithm and graph theory, image segmentation, the method used as a watershed algorithm and Normalized Cut method
Graph
- 通过深度和广度遍历 实现对图各节点的遍历算法-Achieved by traversing the depth and breadth of the graph traversal algorithm for each node
Dijkstra
- Dijkstra s algorithm!!! How you can find the shortest path in a graph
GraphAlgorithm
- 图论算法，acm的图论类的模板，有一些经典算法作为例子，实现过程经过了实际题目的验证保证准确-Graph algorithm, acm the graph of the class template, some of the classic algorithm as an example, after the actual implementation process to ensure accurate verification of title
maxflow-v3.01.src.tar
- 基于文献“计算机视觉中的能量函数最小化的最小割/最大流”的最大流算法实现-An implementation of the maxflow algorithm described in An Experimental Comparison of Min-Cut/Max-Flow Algorithms for Energy Minimization in Computer Vision. Yuri Boykov and Vladimir Kolmogorov.
mitk
- 实现了三维超声PNN算法的GPU加速；实现GPU加速的CT圆轨道平板探测器FDK重建算法；提供对canny边缘检测算法的支持；提供交互式graph cut分割方法；实现OSTU分割算法；-Three dimensional ultrasound PNN algorithm GPU acceleration to achieve GPU accelerated CT reconstruction algorithm for circular orbits FDK flat panel detec
matlabyiqunsuanfa
- 蚁群算法是一种用来在图中寻找优化路径的机率型算法。是一种求解组合最优化问题的新型通用启发式方法，该方法具有正反馈、分布式计算和富于建设性的贪婪启发式搜索的特点。通过建立适当的数学模型，基于故障过电流的配电网故障定位变为一种非线性全局寻优问题。-Ant colony algorithm is a method used to find optimal path in the graph the probability-based algorithm. Is a combination of opt
graph
- 计算机数据结构图的最短路径算法：D算法（输入权值和顶点）-Computer data structure diagram of the shortest path algorithm: D algorithm (input weights and vertex)
PrimGraph
- Prim´ s algorithm using graphics finds a minimum spanning tree for a connected weighted undirected graph.
GraphCut_matlab
- graph cut 优化算法的最新版本，包含和Matlab接口，已编译，以及自己的一个简单测试例子程序MyTest，还有一篇经典论文及自己的读书笔记-graph cut optimization algorithm of the latest version, includes and Matlab interface has been compiled, and their example of a simple test program MyTest, there is a classic
Grapth
- 这是C++图算法第五版中的源代码，对于学习图是很好的，可以学到很多知识。-This is the fifth edition of C++ graph algorithm in the source code is good for the learning plan, you can learn a lot of knowledge.
CPP_Algorithms_sorcecde1-4
- C++图算法第１至第４部分源代码，这本书是Robert Sedgewick写的，代码是C++格式的，对于学习图算法是非常好的。-C++ graph algorithm 1 to 4 parts of the source code, this book is written in Robert Sedgewick, the code is C++ format, graph algorithm for learning is very good.
graph-hashing
- 图像的谱哈希算法，输入图像，然后提取图像的gist特征，经过谱哈希算法，产生哈希序列-Spectral image hash algorithm, the input image, and then extract the image of the gist features through spectral hash algorithms produce hash sequence
ART
- 双连通图 计算机算法 双连通图算法的设计与实现-Double Double connectivity graph graph algorithm computer algorithm design and implementation
graphCplusplus
- 图论算法库 ,用c++写的,还不错.包括bellman_ford, floyd-Graph algorithm library, written using c++, not bad. Including bellman_ford, floyd
aaaa
- 带权有向图的最短路径及拓补排序算法,用于计算最短路径的算法-Weighted directed graph of shortest paths and expand up sorting algorithm used to calculate the shortest path algorithm
graph
- 基于控制点的图象变形方法及其应用,可快速根据控制点进行变形，算法相对简单-Image deformation based on control points and its application, and can be deformed under the control points, the algorithm is relatively simple
floyd
- Floyd算法又称为弗洛伊德算法，插点法，是一种用于寻找给定的加权图中顶点间最短路径的算法。 -Floyd algorithm, also known as Floyd algorithm, insertion point method, is used to find a given weighted graph algorithm shortest path between vertices.