搜索资源列表
graph
- 图的邻接表存储和深度优先搜索，采用的是递归。-Graph adjacency list storage, and depth-first search, using recursion.
shendutuxiang
- 由生成的深度图象数据用平滑算子和差分方法求曲面的高斯曲率和平均曲率-By the depth of image data generated by a smooth operator and the difference method for the Gaussian curvature surface and the average curvature
datastructure
- 设计邻接表类,实现无向图的深度优先非递归遍历,无向图的广度优先遍历,并设计主函数输入数据进行测试-Design category adjacency list, realize undirected graph of the depth-first traversal non-recursive, non-directed graph breadth-first traversal, and the design of the main
tudejibencaozuo
- 数据结构中关于图的基本操作。对给定图，实现图的深度优先遍历和广度优先遍历。-Data structure on the basic operation of Fig. On a given map, the realization of the depth-first graph traversal and breadth-first traversal.
dfstraverse
- 完成输入图，然后进行图的深度优先遍历-Complete the input map, and then proceed to map the depth-first traversal
picture
- 实现图的遍历。对图的深度和广度的遍历，建立邻接矩阵与邻接表-The realization of graph traversal. To map the depth and breadth of the traverse, the establishment of adjacency matrix and adjacency list
graph_
- //有向图:有向图,无向图基本操作 //运行环境：VC //有向图,无向图基本操作,包括: //1、邻接矩阵 //2、邻接表 //3、深度优先遍历 //4、广度优先遍历 //5、最小生成树 //6、拓扑排序 //7、每一对顶点之间的最短路径（Dijkstra,Floyd两种算法）-//Directed graph: directed graph, undirected graph basic o
tu_bianli
- 利用C语言实现数据结构中的图的建立,根据边的数目建立图,并用深度遍历法遍历图等-The use of C language data structure diagram of the establishment, in accordance with the number of edge-building plans, and the depth of traversal method traverse map
tu
- 图的建立以及深度遍历，该代码很简单，是用链式存储的-Map-building, as well as the depth of traversal, the code is very simple, with chain store
tudebianli
- 图的遍历和生成树求解实现（邻接矩阵、邻接表 ―图的深度广度遍历算法的实现和最小生成树PRIM和KRUSCAL算法的实现） -Graph Traversal and Spanning Tree Solution implementation (adjacency matrix, adjacency list- map the depth of breadth traversal algorithm and implementation o
tu
- 图的深度优先遍历，数据结构实验，源码可运行-Map depth-first traversal, the structure of the experimental data, source code can be run
robot_vision_chapter6
- 机器人视觉，遗憾的是只有第六章，包括发展历程、图象处理、场景分析、立体视觉和深度信息等内容-robot vision (chapter 6)
grapher
- 深度优先，广度优先，最短路径，最小生成树的图形演示以及源代码-Depth-first, breadth-first, shortest path, minimum spanning tree, as well as graphical presentation source
tu
- 以邻接表为存储结构，实现连通无向图的深度优先和广度优先遍历。以用户指定的结点为起点，分别输出每种遍历下的结点访问序列。 -To the adjacent table for the storage structures, to achieve connectivity of undirected graph depth-first and breadth-first traversal. To user-specified node a
83390079060624
- 设计程序完成如下功能：对给定的图结构和起点，产生所有的深度优先搜索遍历序列，并给出求解过程的动态演示。 说明：可以用实验工具中的有关功能。
GraphTraversal
- 图的遍历，实现图的深度和广度两种便利方式，方便快速。-Graph traversal, the realization of the depth and breadth of plans to facilitate the two way quickly and easily.
C
- 图的深度优先遍历，图的广度优先遍历，及图的存储-Map depth-first traversal, breadth-first traversal of the graph, and map storage
a
- 一种基于最小割的稠密视差图恢复算法 摘要:针对经典最小割算法计算量大和适应性不足的问题,提出一种改进的基于网络最小割计算稠密深度图的全局优化方法。-Based on the minimum cut of a dense disparity map algorithm to restore
DFS
- 标准的深度优先搜索算法，可实现节点遍历、产生随机路由、检测图中是否有回路等功能，-Standard depth-first search algorithm, the node traversal can be achieved, resulting in a random routing, testing whether there is any loop diagram functions
StereoRegion1
- 基于区域的立体匹配算法 本算法从两幅彩色立体图像对中提取深度信息，使用过滤器消除视差图深度估计中的不稳定性。-Region Based Stereo Matching Algorithms region based stereo matching algorithms are developed for extraction depth information from two color stereo image