搜索资源列表
图的深度优先周游_递归_邻接矩阵
- 图的深度优先算法，这个算法非常的实用，应该经常被用到-map the depth priority algorithm, the algorithm is very practical, should always be used
图深度优先
- 图的深度优先算法动态演示，用到了直线的中点绘制算法-map algorithm for dynamic priority depth demonstration of the use of linear midpoint Rendering Algorithm
深度优先搜索pathfinding
- 人工智能寻路算法，深度优先算法
深度优先算法解决TSP问题
- 深度优先算法解决TSP问题深度优先算法解决TSP问题
有界深度优先算法八数码问题
- 该算法首先根据输入的节点数（该程序可选的有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
Apriori_depth_first
- 数据挖掘/机器学习Apriori的深度优先算法。 编译方法：g++ -Wall -O3 -o fim_all dffast.-Data Mining/Machine Learning Apriori the depth priority algorithm. Compiled : g-Wall-O3-o fim_all dffast.
图的深度优先周游_递归_邻接矩阵
- 图的深度优先算法，这个算法非常的实用，应该经常被用到-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.
八数码多算法实现
- 这个程序是从广度优先搜索，深度优先搜索，A算法以及A*算法等多方面算法来解决八数码问题-this procedure is breadth- first search, depth-first search, A and A* algorithm algorithm various algorithms to solve the problem eight digital
图深度优先
- 图的深度优先算法动态演示，用到了直线的中点绘制算法-map algorithm for dynamic priority depth demonstration of the use of linear midpoint Rendering Algorithm
ChessEight
- 解决八数码问题的经典程序。实现了宽带优先算法，深度优先算法，A* 算法。图形化显示结果。-solve the classic problem of the digital process. Broadband achieved priority algorithm, depth-first algorithm, A* algorithm. Graphic shows results.
EightNUM
- 本程序是利用盲目搜索算法中的深度优先算法实现八数码问题的解决，用的C++的MFC框架类平台，有界面，先置初始状态，然后开始搜索，其中‘0’代表空格，会显示出搜索的步数以及每步的状态。-This procedure is the use of the blind search algorithm of depth-first algorithm to achieve the eight digital issue, used C++ Th
rengongzhineng
- 基于人工智能的深度优先算法!用c语言编写-Based on artificial intelligence algorithm depth-first! Using c language
20075136
- 人工智能 八数码有比较的算法，如广度优先，深度优先，A*算法三种。-Artificial Intelligence has eight digital comparison algorithms, such as breadth-first, depth-first, A* algorithm for three.
lujingguihua
- 用深度优先算法做的一个路径规划。可以从开始点一直移动到目标点，避开障碍物。-Depth-first algorithm used to do a path planning. From the starting point has been moved to the target point, avoiding obstacles.
depth_first_search
- 通过深度优先算法，遍历网络中的每个结点，得到遍历网络节点的时间-Through the depth-first algorithm, network traversal each node, the network node traversal time
DFS
- 深度优先算法，用深度优先来遍历树结构，能够取得很好的复杂度-Depth-first algorithm, using depth-first traversal tree structure to achieve a good complexity
Depth_FirstSearth
- 实现图的深度遍历 是一个深度优先算法 基于树的先跟遍历-Realize the depth chart is a depth-first traversal algorithm is based on the tree to begin with traversal
深度优先算法
- 这是基于Java的深度优先算法，里面所用到的封装函数是算法第四版的内容(This is the depth first algorithm based on Java)