Location:
Search - graph
Search list
Description: segment on graph cut
Platform: |
Size: 21030 |
Author: jinre9821 |
Hits:
Description: 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
"Multi-Camera scene Reconstruction via Graph Cuts"
In: European Conference on Computer Vision, May 2002.
Vladimir Kolmogorov and Ramin Zabih
"Computing Visual Correspondence with Occlusions using Graph Cuts"
In: International Conference on Computer Vision, July 2001.
and
Yuri Boykov, Olga Veksler and Ramin Zabih
"Markov Random Fields with Efficient Approximations"
In: IEEE Computer Vision and Pattern Recognition Conference, June 1998.
Platform: |
Size: 1319269 |
Author: newship@126.com |
Hits:
Description: graph, heap, sorting, timing source code
Platform: |
Size: 109937 |
Author: china_rmb@sohu.com |
Hits:
Description: graph, heap, sorting, timing source code
Platform: |
Size: 109937 |
Author: china_rmb@sohu.com |
Hits:
Description: 基于图方法的图像分割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.
Platform: |
Size: 21504 |
Author: liufu |
Hits:
Description: 实现无向图(或有向图)的存储表示,并输出对该图的广度优先（或深度优先）遍历。
系统具备如下的功能：
1．初始化。从键盘输入图的顶点数与边数。
2．输出图的相应的存储表示。
3．输出图的广度优先遍历序列。
4．输出图的深度优先遍历序列。-Realize undirected graph (or digraph) express storage and output of the graph breadth-first (or depth-first) traversal. The system has the following features: 1. Initialization. From the keyboard input graph Vertices and edges. 2. The corresponding output map of the store said. 3. Output graph breadth-first traversal sequence. 4. Output graph depth-first traversal sequence.
Platform: |
Size: 88064 |
Author: 张娟 |
Hits:
Description: 实现了图的主要操作:（1）分别用邻接矩阵和邻接表实现图的基本操作（包括图的广度和深度优先搜索）；(2）判断该图是否连通，输出该图的连通分量数目；（3）输出一个每一个连通分量的最小生成树。-The main achievement of the plan steps: (1), respectively, with adjacency matrix and adjacency list to achieve the basic map operations (including map the breadth and depth-first search) (2) to determine whether the connectivity of the graph, the output of the graph the number of connected components (3) the output of a connected component of every minimum spanning tree.
Platform: |
Size: 20480 |
Author: 李雅芳 |
Hits:
Description: 图的邻接表存储和深度优先搜索，采用的是递归。-Graph adjacency list storage, and depth-first search, using recursion.
Platform: |
Size: 1024 |
Author: 谢斌 |
Hits:
Description: graph是一款linux/unix下绘制数据曲线图形的程序，用C++编写。-graph is a linux/unix data under the curve of graphics rendering procedures, using C++ prepared.
Platform: |
Size: 43008 |
Author: 阿商 |
Hits:
Description: 高级图论算法讲义，涵盖连通性，匹配，覆盖，染色理论等方面的一些高级算法及话题。-Advanced Graph Theory Algorithm lectures, covering connectivity, matching, covering, dyeing and other aspects of the theory of some senior algorithm and topic.
Platform: |
Size: 1316864 |
Author: humanhx |
Hits:
Description: 图论算法库，包括以下算法：
单源最短路径 Dijkstra 算法
单源最短路径 Bellman-Ford 算法
最小生成树 Prim 算法
每对节点间最短路径 Flod-Warshall 算法
程序用C++语言编写，在VisualAge C++ 4.0下调试通过。压缩包内的Graph.h文件包含所有的库函数，其调用接口见程序内注释。其他的文件是用来测试算法的测试程序，在VisualAge C++ 4.0下编译运行。
该算法是为参加ACM/ICPC竞赛而准备的资料，由于竞赛的对编程速度要求较高，所以为了将代码写的短一点，为了便于调试，代码的写的并不是最优的。
该代码在VisualAge C++ 4.0下写成，但是很容易将其移植到MS Visual C++上。
-err
Platform: |
Size: 10240 |
Author: lllstar |
Hits:
Description: 图的各种存储结构，特别要熟练掌握邻接矩阵和邻接表存储结构。
遍历是图各种应用的算法的基础，要熟练掌握图的深度优先遍历-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 applications based on algorithms, it is necessary to master the graph depth-first traversal
Platform: |
Size: 1024 |
Author: fan |
Hits:
Description: 图的邻接表存储表示法 源码 这是进行计算机图论算法的基础 如最基本算法DFS BFS
图的邻接表存储表示法 源码 这是进行计算机图论算法的基础 如最基本算法DFS BFS-Adjacency list graph representation of source storage This is a computer algorithm based on graph theory such as the basic algorithm DFS BFS graph adjacency list representation storage source This is a computer algorithm based on graph theory such as the basic algorithm DFS BFS
Platform: |
Size: 880640 |
Author: cuiyuzheng |
Hits:
Description: powerbuild for graph exmple
Platform: |
Size: 27648 |
Author: mykor51 |
Hits:
Description: Real Time 2D Graph which has been tested
Platform: |
Size: 58368 |
Author: song ping |
Hits:
Description: 图的算法的基本训练
1、 图的存储结构的定义和图的创建
图的种类有：有向图、无向图、有向网、无向网。
图的存储结构可采用：邻接矩阵、邻接表。
要求：分别给出邻接矩阵和邻接表在某一种图上的创建算法
2、 图的遍历：非递归的深度优先搜索算法、广度优先搜索算法。
3、 图的深度遍历的应用：求无向连通图中的关节点（教材P177-178,算法7.10和7.11）
4、 图的广度遍历的应用：给定图G，输出从顶点v0到其余每个顶点的最短路径，要求输出各路径中的顶点信息。
-Map of the basic training algorithm 1 and the storage structure of the definition and plans to create the types of plans are: directed graph, undirected graph, to the network, no to the network. Map storage structure can be: adjacency matrix, the adjacent table. Requirements: adjacency matrix is given, respectively, and adjacent table in a certain kind of map creation algorithm 2, graph traversal: Non-recursive depth-first search algorithm, breadth-first search algorithm. 3, graph traversal depth of applications: for Undirected connected graph of the key points (teaching P177-178, Algorithm 7.10 and 7.11) 4, Fig traverse the breadth of applications: a given graph G, the output from the vertex v0 to The rest of each vertex of the shortest path, the path of the output requirements of the vertex information.
Platform: |
Size: 7168 |
Author: bueaty |
Hits:
Description: 图的邻接链表及遍历及基本操作，节点的插入删除等基本操作，适合初级算法学习者-Adjacency list graph and traversal and basic operations, insertion node to delete such basic operations, suitable for primary algorithm learners
Platform: |
Size: 158720 |
Author: cscaoshang |
Hits:
Description: 图的基类以及最短路径算法，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 the data structure and algorithm.
Platform: |
Size: 663552 |
Author: 张淼 |
Hits:
Description: 图的一系列性质,通过输入图的结点和边,输出图的各种矩阵,并可判断图是否是连通图,欧拉图等性质.-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 of the Euler diagram.
Platform: |
Size: 3072 |
Author: Jimmy |
Hits:
Description: graph theory with applications to engineering
Platform: |
Size: 4576256 |
Author: omyazan |
Hits:
« 12
3
4
5
6
7
8
9
10
...
50
»