搜索资源列表
TWOAlgorithm
- 包括两个有趣的算法：老鼠走迷宫和运算式中序式转后序式的C和JAVA实现的两个版本-including two interesting algorithm : Mouse Maze and the computation of the order after the order-to-C and JAVA two versions
mazel
- 走迷宫小程序,很好玩,自己和几个朋友随便玩着设计的-small Maze procedure is a lot of fun, they and several friends casually performers play design
PathFinder_Applet
- 一个很有意思的互动式的走迷宫程序。你可以用鼠标画出一个迷宫，然后电脑会找出迷宫走法。 当你点击\"Go\"按钮后，蓝色点会在你绘制的迷宫中试图找出通往绿色点的路径。-a very interesting interactions between the Maze procedure. You can use the mouse painted a labyrinth, and then the computer would find the maze in law. When you cli
走迷宫
- 一个C做的走迷宫-do Maze
C迷宫代码
- 这是迷宫代码，输入一个任意大小的迷宫，用栈求出一条走出迷宫的路径，并 显示在屏幕上。-code, the importation of an arbitrary size of the maze, with a stack get out of the maze of trails and on the screen.
g
- 走迷宫游戏字符界面的ASP程序哦,我觉得还不错,大家下来看看撒
Mouse
- Mouse走迷宫是循环求解的基本类型，我们在二维数组中用2来表示迷宫的墙壁，使用1来表示老鼠的行走路径，并用程序求出从入口到出口的距离。
迷宫一个走迷宫的程序
- C编写的一个迷宫的源代码-prepared a maze of source code
laoshu
- 走迷宫的程序，用JAVA编写的-Maze procedure, prepared by using JAVA
flash迷宫游戏源码
- flash迷宫游戏源码,生命值，最短时间走出迷宫,flash migong
JAVA_zoumigong
- 使用Java语言实现走迷宫功能，并具有选择墙和路的图像、英雄榜。-Use Java language the Maze functions, and select the image of the wall and the road Armory.
AutoMaze
- 走迷宫程序，小球进入迷宫，然后自动去寻找出口．-Maze procedure, a small ball into the maze, and then automatically go looking for export.
maze
- 实现走迷宫的功能，能够随机生成路径，确保只有一条可行路径-To achieve the functions of Maze, the path can be randomly generated to ensure that there is only one feasible path
Mouse_puzzle
- 老鼠走迷宫的代码,用java编程完成，可供参考-mouse puzzle
JAVA
- 两个简单的 JAVA走迷宫代码，希望对广大学习者有所帮助。-Maze two simple JAVA code, want to help the majority of learners.
Maze
- 走迷宫小游戏。 用JAVA实现的小游戏。-java
Text78
- 走迷宫小游戏。 用JAVA语言实现的小程序。-java
mazegames
- 一款java设计的游戏，走迷宫，用于初学者理解java语言-Design of a java game, Maze, for beginners to understand java language
migong
- 用JAVA实现的电脑鼠走迷宫，对于学习JAVA很有帮助-Implemented with JAVA computer mouse maze, very helpful for learning JAVA
maze
- Java上的一个走迷宫程序，迷宫自动生成，根据每个格子的数字找出从起点到终点最短路径-Java on one Maze procedure, maze automatically generated, according to the number of each check to find the shortest path from start to finish