走出迷宫 Maze

参考着书籍，终于写出了求出迷宫一条路径的程序，但还是有个问题： 就是遇到有些情况会在原地打转。

请高手指点，使用VC++ 6.0 编译。

文件清单：

1. map.txt

2. stack.h

3. stack.cpp

4. maze.h

5. maze.cpp

6. main.cpp

 

1.首先迷宫文件格式map.txt：

行数  列数

。。。。。。

。。。。。。

。。。。。。

5 5 1 1 0 1 1 1 1 1 1 0 1 1 0 1 0 1 0 0 1 0 1 1 1 1 1

2.  栈的头文件 stack.h：

/* stack declaration stack charactor is : LIFO (Last In First Out) */ #include "maze.h" #ifndef _STACK_H_ #define _STACK_H_ typedef struct { int iOrder; //通道块在路径上的序号 Position seat; //通道块在迷宫中的位置 Direction direction; //到下个通道的方向 }ElemType; typedef struct node { ElemType data; struct node *next; }Node; class Stack{ public: Stack(); bool Push(ElemType elem); bool Pop(ElemType &elem); bool isEmpty(); bool GetTop(ElemType &elem); bool Traverse(); int GetLength(); ~Stack(); private: Node *top; // 栈顶节点 Node *base; // 栈底节点 int iLength; }; #endif // _STACK_H_

 

3. 栈的实现文件stack.cpp：

/* stack definition */ #include "stack.h" /* Parameter : NONE Return : NONE Description : stack class default constructor */ Stack::Stack() { cout<<"stack constructor"<<endl; base = new Node; top = base; iLength = 0; } // default constructor /* Parameter : ElemType Return : true or false Description : push an element to the stack */ bool Stack::Push(ElemType elem) { Node *temp; temp = new Node; temp->data = elem; temp->next = NULL; top->next = temp; top = temp; iLength++; return true; } // Push /* */ bool Stack::Pop(ElemType &elem) { if (isEmpty()) return false; else { elem = top->data; iLength--; return true; } } // Pop /* Parameter : NONE Return : stack length Description : get stack current length */ int Stack::GetLength() { return iLength; } // GetLength /* Parameter : ElemType & Return : void Description : get stack top element store in the &elem */ bool Stack::GetTop(ElemType &elem) { return true; } // GetTop /* Parameter : NONE Return : true or false Description : if stack is empty then return true */ bool Stack::isEmpty() { if (top == base) return true; else return false; } // isEmpty /* Parameter : NONE Return : true or false Description : Visit stack elements from base to top in order */ bool Stack::Traverse() { Node *p = base->next; if (isEmpty() ) { cout<<"stack is empty now!"<<endl; return false; } while (p) { cout<<"Order : "<<p->data.iOrder<<endl; cout<<"Direction : "<<p->data.direction<<endl; cout<<"Position : ("<<p->data.seat.xPos<<","<<p->data.seat.yPos<<")"<<endl; p = p->next; } return true; } // Traverse /* Parameter : NONE Return : NONE Description : stack class default destructor */ Stack::~Stack() { cout<<"stack destructor"<<endl; } // default destructor

4.  迷宫的头文件 Maze.h：

/* Maze class declaration */ #include <iostream> #include <fstream> #include <iomanip> using namespace std; #ifndef _MAZE_H_ #define _MAZE_H_ typedef struct { int xPos; int yPos; }Position; enum Direction{East, South, West, North}; class Maze{ public: Maze(); Direction NextDir(Direction curDir); Position NextPos(Position curPos, Direction dir); bool isPass(Position curPos); bool MazePath(Position start, Position end); void ShowMaze(); void PrintFoot(Position curPos, int curStep); void MarkPosition(Position curPos); ~Maze(); private: int line; //迷宫实际行数 int column; //迷宫实际列数 int map[20][20]; //迷宫数组[行][列] }; #endif // _MAZE_H_

 

5. 迷宫的实现文件Maze.cpp：

/* Maze class definition */ #include "maze.h" #include "stack.h" /* Parameter : none Return : none Description : class default constructor 定义可通过路径为1, 不可通过路径为0, 墙元素为-1 */ Maze::Maze() { fstream MazeFile("map.txt", ios::in); if (!MazeFile.is_open()) { cout<<"maze map file is not open! "<<endl; } MazeFile>>line>>column; for (int i=1; i <= line; ++i) { for (int j=1; j <= column; ++j) { MazeFile>>map[i][j]; } } // add a fence for (int j = 0; j <= line+1; ++j) { map[0][j] = -1; map[line+1][j] = -1; } for (int k = 1; k <= column; ++k) { map[k][0] = -1; map[k][column+1]= -1; } } // Maze /* Parameter : Direction Return : Direction Description : get current's next direction */ Direction Maze::NextDir(Direction curDir) { switch (curDir) { case East: return South; break; case South: return West; break; case West: return North; break; case North: return East; break; } } // NextDir /* Parameter : Position, Direction Return : true or false Description : */ Position Maze::NextPos(Position curPos, Direction dir) { Position nextPos; switch( dir ) { case East: cout<<"next direction is east "<<endl; nextPos.xPos = curPos.xPos; nextPos.yPos = curPos.yPos + 1; break; case South: cout<<"next direction is south"<<endl; nextPos.xPos = curPos.xPos + 1; nextPos.yPos = curPos.yPos; break; case West: cout<<"next direction is west"<<endl; nextPos.xPos = curPos.xPos; nextPos.yPos = curPos.yPos - 1; break; case North: cout<<"next direction is north"<<endl; nextPos.xPos = curPos.xPos - 1; nextPos.yPos = curPos.yPos; break; } cout<<"next postion : ("<<nextPos.xPos<<","<<nextPos.yPos<<")"; int iValue = map[nextPos.xPos][nextPos.yPos]; cout<<" value : "<<iValue<<endl; return nextPos; } // isPass /* Parameter : Position Return : bool Description : if the current position can pass return true */ bool Maze::isPass(Position curPos) { if (map[curPos.xPos][curPos.yPos] == 1) { cout<<"("<<curPos.xPos<<","<<curPos.yPos<<") can pass..."<<endl; return true; } else { cout<<"("<<curPos.xPos<<","<<curPos.yPos<<") can not pass..."<<endl; return false; } } // isPass /* Parameter : Position, Position Return : true or false Description : find a path between start point and end point */ bool Maze::MazePath(Position start, Position end) { Stack path; // use default constructor to initialize ElemType elem; Position curPos = start; int iStep = 1; cout<<"entrance : ("<<start.xPos<<","<<start.yPos<<")"<<endl; cout<<"exit : ("<<end.xPos<<","<<end.yPos<<")"<<endl; do { if (isPass(curPos)) { // if current position can pass PrintFoot(curPos, iStep); elem.iOrder = iStep; elem.seat.xPos = curPos.xPos; elem.seat.yPos = curPos.yPos; elem.direction = East; path.Push(elem); iStep++; if (curPos.xPos == end.xPos && curPos.yPos == end.yPos) { path.Traverse(); return true; } curPos = NextPos(curPos, elem.direction); } else { // if current position can not pass if (!path.isEmpty()) { path.Pop(elem); iStep--; if (elem.direction == North && !path.isEmpty()) { MarkPosition(elem.seat); path.Pop(elem); iStep --; } if (elem.direction != North) { elem.direction = NextDir(elem.direction); // try next direction path.Push(elem); iStep ++; curPos = NextPos(elem.seat, elem.direction); } } } } while(!path.isEmpty()); return false; } // MazePath /* Parameter : Position, int curStep Return : none Description : make the current position as step */ void Maze::PrintFoot(Position curPos, int curStep) { map[curPos.xPos][curPos.yPos] = curStep; } // PrintFoot /* Parameter : Position Return : none Description : make current position can not be passed */ void Maze::MarkPosition(Position curPos) { map[curPos.xPos][curPos.yPos] = -1; } // MarkPosition /* Parameter : none Return : void Description : output the maze */ void Maze::ShowMaze() { cout<<"-------- show maze --------"<<endl; /* // show maze include fence for (int i = 0; i <= line+1; ++i) { for (int j = 0; j <= column+1; ++j) { cout<<setw(4)<<map[i][j]; } cout<<endl; } //*/ ///* // show maze without fence for (int i = 1; i <= line; ++i) { for (int j = 1; j <= column; ++j) { cout<<setw(4)<<map[i][j]; } cout<<endl; } //*/ } // ShowMaze /* Parameter : none Return : none Description : class default destructor */ Maze::~Maze() { cout<<"maze class destructor"<<endl; } // ~Maze

 

6.  主函数Main.cpp ：

//----------------------------------------------------------------------------- // Copyright (c) 2009 All rights reserved. // // File : Main.cpp // Author : eryar@163.com // Date : 2009-07-18 11:31 // // Version : 1.0v // Description : // //============================================================================= #include "maze.h" int main(int argc, char *argv[]) { Maze maze; Position entrance = {1, 1}; Position exit = {5, 5}; maze.ShowMaze(); maze.MazePath(entrance, exit); return 0; }

 

问题已经解决，是出栈操作有误。

Happy~~