搜索资源列表
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.
bellman-ford.c
- bellman-ford algorithm to find shortest distance in a graph. useful for path planning.
SPA
- 首先介绍了LDPC码的校验矩阵和其因子表示方法，然后利用二分图对和积解码算法进行了详细的描述，最后给出了信度传播概率译码算法详细步骤，并对关键公式作了证明-This paper,first introduces the check matrix and the factor graph of LDPC,then describes the sum-product algorithm by using the factor graph,and finally presents the deta
graph
- 数据结构——图的基本结构 求给定图中的边（或弧）的数目。 求解出从给定顶点到所有顶点的最短路径（以边数计算）。 判断一个有向图g是否是一棵有向树。（任意一个顶点可能是根） 对给定的图G及出发点，设计算法从出发深度遍历图G，并构造出相应的生成树。 -Data structure- that the basic structure of the given graph edge (or arc) number. Solving out from a given vertex to a
imRAG
- 一个图论算法实现的matlab集大成的matlab 程序。很好。好方便-it is a graph algorithm based on matlab platform very useful for beginner.
shortroad
- 最短路径克鲁斯卡尔算法的实现，输入一张图，会自动进行算法计算-Kruskal shortest path algorithm, input a graph algorithm automatically
floyd
- 插点法一种用于寻找给定的加权图中顶点间最短路径的算法-Insertion point method for finding a given weighted graph algorithm shortest path between vertices
graph
- 1、在文本文件中按照一定的格式存储图的数据 2、从文件中读入该信息，并且构造两种存储方式 3、输出两种存储方式，并进行转化，看是否得到了正确的结果 4、在邻接表的基础上实现图的遍历操作 5、编写图的最小生成树算法，并进行验证 6、编写最短路径算法，并对输入的图进行验证 -1, in a text file format according to certain data stored in Figure 2, read from the file of the infor