Description: Maze problems, were the depth and breadth of priority traversal solution. Stack with the achievement of which list, queue to use the array to achieve. Description see pdf file.
- [maze1] - breadth- first through the maze to find
- [mazepath] - Maze is a classic problem, but also the
- [shortestway] - Data structure to achieve the shortest p
- [graph_] - //Directed graph: directed graph, undire
- [Maze~manual~operation] - Maze game manual, games were divided int
- [shujujiegou] - Strict version of C language " data
File list (Check if you may need any files):
array_queue.h
building.cpp
Building.h
building.txt
cell.cpp
cell.h
Description.pdf
llstack.cpp
llstack.h
main.cpp
tlist.h
Download