搜索资源列表
Algorithm
- A＊算法，A＊模拟器，用于在迷宫中找到最近出口-A* algorithm, A* simulator used in the maze to find the nearest exit
seekpath
- 一个比较简单的使用递归算法实现的迷宫程序。程序中1代表墙，0代表路。-Using a relatively simple recursive algorithm maze procedure. 1 represents the wall of the program, 0 road.
migong
- 用MFC写的迷宫小游戏，使用递归算法求解路径，迷宫可以自行设置-Written with MFC maze path using a recursive algorithm, you can set your own maze
SimulatorMatlab
- 模拟机器人在迷宫寻找出口的程序，使用蒙特卡洛算法定位，模拟测试找路程序-Simulated robot in a maze looking for export, the use of Monte Carlo algorithm to locate, find a way to simulate the test program
Maze
- 利用栈实现走迷宫的算法，走通的路径，走过但走不通的路径也已标出-Use stacks maze algorithm, the path to go through, and walked the path that leads to nowhere, but has also been marked
FindMaze
- 从迷宫的入口找到穿过迷宫的路径到达迷宫出口，采用回溯算法，数据结构为堆栈-From the entrance of the maze to find the path through the maze to reach the maze exit, using backtracking algorithms, data structures for the stack
Maze
- 使用递归方法与非递归方法求解迷宫问题。内容涉及递归的消去、属于数据与算法课程。-Use recursive and non-recursive method for solving approach maze. Covering recursion elimination, part of the data and algorithms course.
LS_AStarUniversal
- 自己研发的A*算法类，并且利用机器人走迷宫的形式验证了算法的可行性，并且返回了基于像素点的所走路径长度。-A* algorithm developed their own classes, and the use of robots to verify the feasibility of the maze in the form of the algorithm, and returns the pixel-based point of the walking path length.
Maze-Generration-and-routing
- 设计算法生成一个N×M(N行M列)的迷宫，完成迷宫的组织和存储。实现两种不同的迷宫路由算法：广度优先和深度优先算法，并比较(包括理论和实验)两种方法的时间复杂性。-Design algorithm to generate a NM (N rows and M columns) of the maze, the maze to complete the organization and storage. Achieve two different maze routing algorithms:
zhouligong-77-migong-suanfa
- 本代码为广州周立功公司所作。。 本人只是在此基础上做了算法上的改进，， 本代码只可以走7*7的迷宫，，若要走其他的迷宫可以修改Mouse_Config.h里的配置。。 起点为迷宫的任意一个角落，，终点为对角-The code is made by Guangzhou weeks meritorious. . On this basis, I just did on the improved algorithm, this code can only walk the la
diannaoshu-hunanshengsai-
- 具有特殊点处理 具有冲刺加速 在迷宫边缘为随机算法，中心为中心法则-Sprint has a special point processing has accelerated in the maze edge of randomized algorithms, the center is the central dogma
AStar
- AStar算法的一个二位迷宫实现, 运行main函数即可-AStar algorithm to achieve a two maze, you can run the main function
Maze
- 在labview中实现迷宫的功能 主要采用数据结构中的堆栈和深度优先的算法实现-Maze functions in labview mainly uses a stack data structure and depth-first algorithm
MIGONGWENTI
- 设计数据结构存储迷宫； 设计存储结构保存从人口到出口的通路 设计算法完成迷宫问题的求解； 分析算法的时间复杂度。-Design data structures stored maze designed to save storage structure is completed to solve the maze of passages from the population to export design algorithms analysis time complexity
1001
- 利用回溯法实现的迷宫求解问题，算法效率高-Maze Solving
migongqiujie
- 使用栈结构完成迷宫求解算法演示，设计了GUI界面使算法演示更加直观-Using the stack structure to complete the maze solving algorithm demonstration, design the GUI interface makes the algorithm shows more intuitive
Exp3
- 这是清华大学数据与算法实验作业。题目为：迷宫问题。-It is the job of Tsinghua experimental data and algorithms. Entitled: maze.
Romeo-and-Juliet-maze-problem
- 罗密欧与朱丽叶的迷宫问题。罗密欧与朱丽叶身处一个m×n的迷宫中，如图所示。每一个方格表示迷宫中的一个房间。这m×n个房间中有一些房间是封闭的，不允许任何人进入。在迷宫中任何位置均可沿8 个方向进入未封闭的房间。罗密欧位于迷宫的(p，q)方格中，他必须找出一条通向朱丽叶所在的(r，s)方格的路。在抵达朱丽叶之前，他必须走遍所有未封闭的房间各一次，而且要使到达朱丽叶的转弯次数为最少。每改变一次前进方向算作转弯一次。请设计和实现一个算法帮助罗密欧找出这样一条道路。-Romeo and Juliet m
maze_v5
- 用c语言编写的一个小的迷宫游戏，加入了深度算法。-Using c language a little maze game, adding depth algorithm.
path
- 求迷宫的最短路径,设计一个算法找一条从迷宫入口到出口的最短路径。-Find the shortest path maze design an algorithm to find a shortest path from the entrance to the maze exit.