搜索资源列表
图的深度优先周游_递归_邻接矩阵
- 图的深度优先算法，这个算法非常的实用，应该经常被用到-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
有界深度优先算法八数码问题
- 该算法首先根据输入的节点数（该程序可选的有3X3，4X4…9X9几种节点数），然后输入初始状态和终点状态-the algorithm depending on the input nodes (which are optional procedures 3X3, 4X4 ... Frankfurt several nodes), then the initial state and the end of state
迷宫问题的算法(优于广度优先,深度优先,递归)
- 迷宫问题的算法(优于广度优先,深度优先,递归).-maze of algorithm (priority than breadth, depth priority, recursive).
迷宫问题的算法(优于广度优先,深度优先
- 迷宫问题的算法(优于广度优先,深度优先-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
邻接矩阵表示图
- 用邻接矩阵存储表示图的结构，采用的是深度优先算法
lujingguihua
- 用深度优先算法做的一个路径规划。可以从开始点一直移动到目标点，避开障碍物。-Depth-first algorithm used to do a path planning. From the starting point has been moved to the target point, avoiding obstacles.
pso_pathplanning
- 粒子群(PSO)路径规划。这个是一个局部路径规划，用了深度优先搜索算法，可以走出“陷阱”。-Particle Swarm (PSO) path planning. This is a local path planning, with a depth-first search algorithm, we can get out a
depth_first_search
- 通过深度优先算法，遍历网络中的每个结点，得到遍历网络节点的时间-Through the depth-first algorithm, network traversal each node, the network node traversal time
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
Depth_FirstSearth
- 实现图的深度遍历 是一个深度优先算法 基于树的先跟遍历-Realize the depth chart is a depth-first traversal algorithm is based on the tree to begin with traversal
FiveGame6_1
- 具有人工智能的五子棋游戏，采用流行的深度优先算法，外加Alpha-Beta剪枝，再加历史启发优化，可搜索到第4步-Backgammon game with artificial intelligence, using the popular depth-first algorithm, plus Alpha-Beta pruning, combined with historical inspiration optimized search to Step 4
DFS3
- 我自己用matlab写的深度优先算法，能够实现任意选择起色访问点进行访问的DFS算法-Matlab write my own use depth-first algorithm, to achieve any improvement in access point choose to visit the DFS algorithm
图基本算法
- 图基本算法,包括存储、深度优先遍历，层次遍历，最短路径、最小生成树等(basic algorithm of graph)
深度优先算法
- 这是基于Java的深度优先算法，里面所用到的封装函数是算法第四版的内容(This is the depth first algorithm based on Java)