搜索资源列表
maze dfs
- dfs 深度优先搜索！这是走迷宫的基本算法。用广义表建立迷宫，用邻接表建立图，用dfs搜索，许多大学的数据结构作业-dfs depth-first search! Maze This is the basic algorithm. Generalized Table established maze, with the establishment of the adjacent table map, with dfs search, the University of many data str
maze_dfs
- solve maze with dfs and bfs
dfssamples
- 朴素的没有优化过的dfs 题目有：借书问题，骑士的游历，迷宫问题，细胞个数-There is no simple optimized dfs topics: library issues, Knight' s tour, the maze problem, the cell number
8_puzzle_solver_2009_10
- AI（人工智能）课程的作业，要求用java语言 随即生成8迷宫问题，然后用dfs解决，请大家参考-AI (Artificial Intelligence) program demands of their workers using java language then generate the eight maze problems, and then use dfs resolved, please refer to the
maze3D
- Source Code OpenGL and Java (JOGL), for generate 3D maze (using DFS algorithm), and you can move a cursor in maze, using your mouse, to find a way out from maze.
AI_9012430217_CA1_part1
- dfs algorithm for solving a maze for a submraine game
main
- 用数据结构来写的迷宫算法。用深搜（DFS）产生迷宫。并用A *寻路算法-Data structure of the maze algorithm to write. Generated maze with deep search (DFS). With A* pathfinding algorithm
maze
- 一种随机迷宫生成的递归分割算法的实现，以及基于DFS算法的自动寻路(Implementation of a recursive algorithm for random maze generation)
迷宫问题
- 图的遍历实践与迷宫问题求解。根据参考书《算法》第4.1节和4.2节关于图的邻接表的创建，使用说明；深度优先遍历（DFS）和广度优先遍历（BFS）算法的实现过程；结合迷宫问题的特点，分别编写基于深度优先遍历（DFS）和广度优先遍历（BFS）思想的迷宫求解过程算法。(Maze problem solving)