搜索资源列表
图的深度优先周游_递归_邻接矩阵
- 图的深度优先算法，这个算法非常的实用，应该经常被用到-map the depth priority algorithm, the algorithm is very practical, should always be used
图搜索策略
- 一个使用Java实现的人工智能的图搜索策略程序——酒九宫图问题 人工智能－图搜索策略－演示程序－使用说明 程序简介 在人工智能领域，对隐式图的搜索是求解问题的一种基本方法，本程序通过使用多种图搜索策略，对 重排九宫问题进行求解，演示了“广度优先搜索”、“深度优先搜索”、“有界深度优先搜索”、 “最好优先搜索”和“局部择优搜索”五种基本的图图搜索策略。 整个程序使用了动画技术，界面设计美观友好，使用方便。-use a Java artificial intelligence plans Searc
图的操作界面
- 图邻接表的建立,深度优先遍历,.广度优先遍历,最小生成树,拓扑排序,单源点到其余各个顶点的最短路径等对图的操作!VC界面!-plans to establish the adjacent table, depth-first traversal. Breadth priority traversal, the minimum spanning tree, topological sorting, single-source all of the rest of the vertices such
0801
- 功能：构造图，并进行图的深度优先遍历（邻接表存储结构），图的广度优先遍历，内附详尽的源代码说明-function : tectonic map, and map depth-first traversal of the (storage structure adjacent table), the breadth of the plan priority traversal, enclosing a detailed note of the source code
两种遍历图的方法
- 熟悉图的两种常用的存储结构，以及在这两种存储结构上的两种遍历图的方法，即深 度优先遍历和广度优先遍历。进一步掌握递归算法的设计方法。 -familiar with the plans of two commonly used storage structure, and the two storage structures on the two traverse map, that depth-first traversal and breadth priority traversal.
tudeshengdubianli
- 图的深度遍历，用二叉树实现，输入时要遵循二叉树的顶点和边数的对应关系-traverse the depth map, using binary tree realize that the importation of binary tree to be followed when the number of vertices and edges of the relationship
Depth-First-Traverse
- 此代码为“图的深度优先遍历”的源代码，图的存储形式为邻接矩阵，里面有图的邻接矩阵存储的代码，有深度优先遍历的算法，还有验证的主函数。-This code for the " depth-first traversal map" of the source code, Figure storage form of adjacency matrix, there are plans stored in the adjacency matrix code, a deep traver
Depth_image
- Algorithm to find Depth of Image
map
- 双目视觉的深度图立体匹配算法改进Binocular stereo vision matching algorithm to improve the depth map-Binocular stereo vision matching algorithm to improve the depth map
Without-the-adjlink-to-map
- 从键盘输入无向图G的顶点个数v及边的个数e。建立有v个顶点、e条边构成的无向图G，采用邻接矩阵表示。V个顶点的值由键盘输入，元素类型为字符型。e条边的信息也由键盘输入。分别调用图的深度优先搜索、广度优先搜索图并输出相应的遍历序列。-Input from the keyboard without the number of vertices to the graph G v and the number of edges e. Establishment of a v vertices, e ed
Depth_Map_Aligner
- Depth_Map_Aligne主要用于深度图的后期处理，是深度图后期处理不可少得工具。-Depth_Map_Aligne mainly used for post-processing the depth map, depth map is very essential tool for post-processing.
Map
- 对图的各种操作，包括深度遍历，广度遍历，最小生成树，最短路径的各中算法，而且有递归和非递归方式，对学习数据结构有很大的帮助。 代码全是自己根据理解自己写的，思路很符合初学者。-Various operations on the map, including the traverse depth, breadth traversal, minimum spanning tree, shortest path in the algorithm, and recursive and non rec
dimats
- 二色散射模型去雾算法，以及深度图的获取，效果较好-Dichroic scattering model to fog algorithms, as well as the acquisition of the depth map, the better
quasidense.tar
- 3D reconstruction using quasi dense method and depth map
Basic-function-of-graph
- 图的基本操作，包括建立邻接矩阵，图的广度和深度优先搜索-The basic operation pattern, including the establishment of the adjacency matrix, the breadth and depth map of priority search
map
- 非常经典的 图的深度和广度优先遍历，可以下载一下学习学习-The depth and breadth very classic graph traversal priority, learn what you can download
depth-map
- 深度图生成，基于立体匹配获取的深度图质量较好-Depth map, depth map based on good quality stereo matching Being
Image-matching
- 用matlab编写的程序，图像匹配和深度图计算程序-Image matching and depth map calculation program
image-inpainting-depth-map
- 基于深度图像的图像修复算法，首先得到待修复图像的深度图像，然后利用图像的深度图对破损区域进行修复。-Based on the image restoration algorithm of depth image, the depth image of the image to be repaired is obtained, and then the damaged region is repaired by using the depth map of the image.
depth-map-prediction-
- 基于AlexNet网络模型的单幅彩色图的深度估计，在NYU Depth 数据集，Make3D 数据集，KITTI 数据集经过测试效果很好，只是本次上传由于大小限制，压缩包不包括数据集，读者可自行下载数据集进行训练！(Based on the AlexNet network model, the depth estimation of a single color map, in the NYU Depth dataset, Make3D dataset, KITTI dataset ha