搜索资源列表
图的深度优先周游_递归_邻接矩阵
- 图的深度优先算法，这个算法非常的实用，应该经常被用到-map the depth priority algorithm, the algorithm is very practical, should always be used
传教士与野人渡河问题深度优先搜索
- 学习人工智能作的一个小设计，用VC++6.0来基本实现传教士和野人渡河问题，这个算法是应用深度优先搜索算法。-study artificial intelligence for a small design, VC 6.0 to achieve missionaries and savage river, the algorithm is the use of depth-first search algorithm.
图深度优先
- 图的深度优先算法动态演示，用到了直线的中点绘制算法-map algorithm for dynamic priority depth demonstration of the use of linear midpoint Rendering Algorithm
20051004深度优先
- 人工智能中的八数码难题 这个采用的是深度优先方法 编程球境是VC++ 解压即可.-artificial intelligence of eight digital problem is the depth of the preferred method of programming ball Habitat VC can be unpacked.
20051004深度优先 人工智能 八数码
- 人工智能中很重要的思想，用深度优先的思想解决八数码问题。-AI is very important idea, with priority to the depth of eight digital thinking to solve problems.
深度优先搜索、广度优先搜索
- 图的深度优先搜索和广度优先搜索。值得一看。-map the depth-first search and breadth - first search. An eye-catcher.
迷宫问题的算法(优于广度优先,深度优先,递归)
- 迷宫问题的算法(优于广度优先,深度优先,递归).-maze of algorithm (priority than breadth, depth priority, recursive).
深度优先搜索
- 深度优先搜索二叉树-depth-first search Binary Tree
迷宫问题的算法(优于广度优先,深度优先
- 迷宫问题的算法(优于广度优先,深度优先-maze of algorithm (priority than breadth, depth priority
深度优先搜索pathfinding
- 人工智能寻路算法，深度优先算法
深度优先算法解决TSP问题
- 深度优先算法解决TSP问题深度优先算法解决TSP问题
正方形 深度优先搜索
- 深度优先搜索 用木棒拼正方形
基于深度优先搜索策略编写一程序
- 试基于深度优先搜索策略编写一程序
数据结构图的邻接矩阵,邻接表存储表示，图的深度优先搜索遍历，广度优先搜索遍历
- 数据结构图的邻接矩阵,邻接表存储表示，图的深度优先搜索遍历，广度优先搜索遍历
8Puzzle_DFS 人工智能经典问题八数码的深度优先搜索算法实现
- 人工智能经典问题八数码的深度优先搜索算法实现。没有图形界面。-Classic problem of artificial intelligence, eight digital breadth-first search algorithm. No graphical interface.
SEAL_det_v1.0.rar
- 基于深度优先搜索算法的球形译码，具体文献可以参考03年information thoery上的那篇经典文章,Depth-first search algorithm based on spherical decoding, can refer to specific literature in 2003 on information thoery came across a classic article
邻接矩阵表示图
- 用邻接矩阵存储表示图的结构，采用的是深度优先算法
dfstraverse
- 完成输入图，然后进行图的深度优先遍历-Complete the input map, and then proceed to map the depth-first traversal
minop
- 最少运算问题 主要是深度优先搜索迭代加深的运用-At least the problem is that computing depth-first search Iterative deepening the use of
lujingguihua
- 用深度优先算法做的一个路径规划。可以从开始点一直移动到目标点，避开障碍物。-Depth-first algorithm used to do a path planning. From the starting point has been moved to the target point, avoiding obstacles.