搜索资源列表
GraphCuts
- 基于图论的高效图像分割方法，比NCut算法的效率更高，效果更好-Based on Graph Theory and efficient image segmentation method, an algorithm NCut more efficient, better
Wireless_MESH_Network_Channel_Assignment_general_M
- 基于粒子群优化的无线MESH网信道分配算法通用MATLAB源码，本算法基于冲突图的粒子群优化算法而来。-Particle Swarm Optimization for Wireless MESH Network Channel Assignment General MATLAB source code, the algorithm is based on the conflict graph from PSO.
curve and fill
- 图形学课程设计.1,扫描转换的四种常用算法:逐点扫描,扫描线算法,边界标志法,边缘填充法. 2,曲线生成算法:bezier算法，3次均匀B样条- The graph study curriculum designs four commonly used algorithms which 1, the scanning transforms: Point-by-point scanning, scan line algorithm, side-stripe markings law, edge
SegmentVideo.tar
- 图像分割元代码，对大部分人学习图割算法进行了实现-Image segmentation element code, for most people to learn graph cut algorithm to achieve
graphic_math_lib
- .net 平台下实现的图形学基本算法函数库-. net platform to achieve the basic algorithm of the graphics library
graphCuts
- 基于Graph Cuts计算机视觉立体视图匹配算法-Computer Vision Graph Cuts Based on three-dimensional view matching algorithm
graphalgorithm
- acm题图算法，详细说明了poj中各种图论题中用到的图算法-acm title graph algorithm, POJ detailed descr iption of the various graphic Topics algorithm used in Figure
Bipartite
- 图论*匈牙利算法 的两种实现过程 Matching的巧妙在于队列的进入退出并没有仅仅限于在同一层循环中做到，构思巧妙 其算法思想在《算法设计与分析基础》上可以参阅-Graph theory* Two Hungarian Algorithm realization process ingenious Matching queue entry and exit is not just limited to the same level as the cycle done, the idea
biMatichHungary
- 偶图最大匹配完全照算法说明利用集合运算实现的matlab代码。这里需要大家讨论的是增广路的选取的算法，希望朋友们多多讨论，争取找一种更好的增广路方法，有想法的一定告诉我，谢谢，jxrhhu@hhu.edu.cn-Bipartite graph maximum matching algorithm descr iption completely according to the use of computing to achieve a collection of matlab code. Her
Hungary
- 匈牙利算法实现二分图最大匹配 文件输入输出.-Hungarian algorithm bipartite graph maximum matching document input and output.
SemanticPhotoSynthesis
- We propose a technique that allows a person to design a new photograph with substantially less effort. This paper presents a method that generates a composite image when a user types in nouns, such as “boat” and “sand.” The artist can optionally
fft
- 快速离散傅立叶变换，实现8点的蝶形图matlab算法-Fast Discrete Fourier Transform to achieve 8:00 of the butterfly graph algorithm matlab
Dijkstra
- 最短路径的Dijkstra算法程序。Dijkstra算法是典型最短路算法，用于计算一个节点到其他所有节点的最短路径。主要特点是以起始点为中心向外层层扩展，直到扩展到终点为止。Dijkstra算法能得出最短路径的最优解，但由于它遍历计算的节点很多，所以效率低。 Dijkstra算法是很有代表性的最短路算法，在很多专业课程中都作为基本内容有详细的介绍，如数据结构，图论，运筹学等等。 -The Dijkstra shortest path algorithm for the proce
DIJKstra
- 数据结构DIJKstra最短路径设计，以及交通图的算法！-Dijkstra shortest path data structure design, as well as the traffic graph algorithm!
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.
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
hgr
- 求二分图最大匹配 匈牙利算法-Seeking the maximum bipartite graph matching for bipartite graph maximum matching algorithm Hungary
11
- 带权图的最短路径问题,主要介绍单源最短路径算法，最短路径问题的提法很多，其它的最短路径问题均可用单源最短路径算法予以解决-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 singl