搜索资源列表
segment on graph cut
segment on graph cut
computing dense correspondence graph cuts
- computing dense correspondence # # (disparity map) between two images using graph cuts This software implements stereo algorithms described in the following papers: Vladimir Kolmogorov and Ramin Zabih
graph, heap, sorting, timing source code-- common datastruct
- graph, heap, sorting, timing source code
graph, heap, sorting, timing source code-- common datastruct
- graph, heap, sorting, timing source code
Graph-Based_segment
- 基于图方法的图像分割C++源码，详细内容参见Efficient Graph-Based Image Segmentation一文。-graph-based methods of image segmentation C source code, See details Efficient Graph- Based Image Segmentat ion a text.
graph
- 实现无向图(或有向图)的存储表示,并输出对该图的广度优先（或深度优先）遍历。 系统具备如下的功能： 1．初始化。从键盘输入图的顶点数与边数。 2．输出图的相应的存储表示。 3．输出图的广度优先遍历序列。 4．输出图的深度优先遍历序列。-Realize undirected graph (or digraph) express storage and output of the graph breadth-first
graph
- 实现了图的主要操作:（1）分别用邻接矩阵和邻接表实现图的基本操作（包括图的广度和深度优先搜索）；(2）判断该图是否连通，输出该图的连通分量数目；（3）输出一个每一个连通分量的最小生成树。-The main achievement of the plan steps: (1), respectively, with adjacency matrix and adjacency list to achieve the basic map o
graph
- 图的邻接表存储和深度优先搜索，采用的是递归。-Graph adjacency list storage, and depth-first search, using recursion.
graph-0.1b.tar
- graph是一款linux/unix下绘制数据曲线图形的程序，用C++编写。-graph is a linux/unix data under the curve of graphics rendering procedures, using C++ prepared.
Graph-Theory
- 图论算法库，包括以下算法： 单源最短路径 Dijkstra 算法 单源最短路径 Bellman-Ford 算法 最小生成树 Prim 算法 每对节点间最短路径 Flod-Warshall 算法 程序用C++语言编写，在VisualAge C++ 4.0下调试通过。压缩包内的Graph.h文件包含所有的库函数，其调用接口见程序内注释。其他的文件是用来测试算法的测试程序，在VisualAge C++ 4.0
graph
- 图的各种存储结构，特别要熟练掌握邻接矩阵和邻接表存储结构。 遍历是图各种应用的算法的基础，要熟练掌握图的深度优先遍历-Map a variety of storage structures, in particular to master the adjacency matrix and adjacency list storage structure. Graph traversal is a wide range of app
graph
- 图的邻接表存储表示法 源码 这是进行计算机图论算法的基础 如最基本算法DFS BFS 图的邻接表存储表示法 源码 这是进行计算机图论算法的基础 如最基本算法DFS BFS-Adjacency list graph representation of source storage This is a computer algorithm based on graph theory such as the basic algori
Graph
- powerbuild for graph exmple
Graph
- Real Time 2D Graph which has been tested
graph
- 图的邻接链表及遍历及基本操作，节点的插入删除等基本操作，适合初级算法学习者-Adjacency list graph and traversal and basic operations, insertion node to delete such basic operations, suitable for primary algorithm learners
Graph
- 图的基类以及最短路径算法，dijkstra,floyd，Kruskal算法等，代码来自北大赵海燕老师编著的数据结构与算法。-Graph base class as well as the shortest path algorithm, dijkstra, floyd, Kruskal algorithm, code Zhao Haiyan teachers from Beijing University and edited by t
graph
- 图的一系列性质,通过输入图的结点和边,输出图的各种矩阵,并可判断图是否是连通图,欧拉图等性质.-Map a series of nature, by entering the graph nodes and edges, the output map of various matrices, and to determine whether it was connected graph chart, such as the nature
graph.theory.with.applications
- graph theory with applications to engineering
Maximum.matching.algorithm.in.general.graph.o(n^3
- A matching on a graph is a set of edges, no two of which share a vertex.
graph
- 图论的算法，最短路，最小生成树，连通，匹配，网络流及应用。-Graph theory, algorithms, shortest path, minimum spanning tree, connectivity, matching, network flow and applications.