搜索资源列表
图的深度优先周游_递归_邻接矩阵
- 图的深度优先算法，这个算法非常的实用，应该经常被用到-map the depth priority algorithm, the algorithm is very practical, should always be used
3DP2D
- 3D数据转化为2.5D,在人脸识别的过程中可以利用到。把三维图像转化为深度图像-3D face database
图论算法的matlab程序实现
- 本资源涵盖了几乎所有matlab图论领域里的算法代码，最短路问题、TSP、最大流、深度优先搜索、广度优先、蚁群算法等等，可为功能强大。
视差图得到具体深度的matlab程序
- 双目匹配得到的视差图，通过此程序可以算出具体某点的深度信息。
shichatu
- 通过执行程序，可以实现对物体视差图的生成，进而可以实现深度图。(Through the implementation of the program, you can achieve the object disparity map, and then you can achieve depth map.)
图的遍历源代码
- 图的深度遍历源代码 ，写的很详细，很好，需要的下(The depth of the graph traversal source code, written in great detail, very good)
图基本算法
- 图基本算法,包括存储、深度优先遍历，层次遍历，最短路径、最小生成树等(basic algorithm of graph)
DFS BFS 图
- 深度优先遍历和广度优先遍历算法实现从定点开始的遍历序列。(Depth first traversal and breadth first traversal algorithm to achieve the starting point from the traversal sequence)
加强图
- 图 深度优先搜索遍历和 邻接矩阵，闫蔚敏版，简单易懂，适合平时交作业(Graph depth first search and adjacency matrix, Yan Yumin version, simple, suitable for everyday homework)
图
- 实现了图的创建，遍历，输出以及广度深度的遍历。(The creation, traversal, output and breadth and depth traversal of the graph are realized.)
图
- 深度优先遍历图，广度优先遍历图，输入深度优先遍历的出发点(Depth first traversal, breadth first traversal, starting point for input depth first traversa)
图
- 验证邻接表存储的图及其上的基本操作，插入、删除、查找、求权值、深度优先遍历和广度优先遍历。(The basic operation of a graph)
图的遍历
- 图的构建以及实现图的深度遍历和广度遍历!!!!!!!!(tudegoujianyijishixiantudeshendubianliheguangdubianli)
图的深度和广度搜索
- 关于图的邻接矩阵的建立和广度和深度遍历结果显示(The establishment of the adjacency matrix of a graph and the result of the breadth and depth traversal)
intrinsic_texture-master
- 可以对输入的一对彩色图和相应的深度图进行本征分解，进而得到specular分量和diffuse分量。(Decomposition of intrinsic image with the help of depth.)
有向图邻接表的建立，深度广度搜索及拓扑排序
- 拓扑排序 对一个有向无环图(Directed Acyclic Graph简称DAG)G进行拓扑排序，是将G中所有顶点排成一个线性序列，使得图中任意一对顶点u和v，若边(u,v)∈E(G)，则u在线性序列中出现在v之前。通常，这样的线性序列称为满足拓扑次序(Topological Order)的序列，简称拓扑序列。简单的说，由某个集合上的一个偏序得到该集合上的一个全序，这个操作称之为拓扑排序(Topological sort A topological sort for a Directed
视差图完整
- 对双目视觉处理的图像通过获取相机的内外参数后得出视差图，而后方便得到深度图等(The binocular vision processing image is obtained by obtaining the camera's internal and external parameters, and then the disparity map is obtained, and then the depth map is obtained.)
视差图程序
- 通过获取摄像机内外参数获得双目视觉处理图像，得到视差图，得到深度图。(The binocular vision processing image is obtained by obtaining the camera's internal and external parameters, and then the disparity map is obtained, and then the depth map is obtained.)
无向图
- 无向图的创建，转化为邻接矩阵输出，及深度、广度优先遍历(The creation of undirected graph is transformed into adjacency matrix output and depth and breadth first traversal.)
图的遍历
- 构造图的邻接表，实现图的深度优先和广度优先算法。(Structure graph adjacency table, graph depth first and breadth-first algorithm.)