用c++实现的迷宫递归算法

程序已经被vc6.0调试过，包括一个头文件maze.h和一个主程序

再附加一个说明文件格式的代码

#ifndef MAZE_H
#define MAZE_H

#include
#include
#include

typedef struct
{int left;
 int forward;
 int right;
}Intersection;

class Maze
{private:
  int mazesize;
  int EXIT;
  Intersection *intsec;
public:
 Maze(char*);
 int TraverseMaze(int);
};

Maze::Maze(char *filename)
{ifstream fin;
 int i;
 fin.open(filename,ios::in|ios::nocreate);
 if(!fin)
 {cerr<<"the maze dose not exist"<   exit(-1);
 }

 fin>>mazesize;
 intsec=new Intersection[mazesize+1];
 for(i=1; i<=mazesize;i++)
  fin>>intsec[i].left>>intsec[i].forward>>intsec[i].right;
 fin>>EXIT;
 fin.close();
}

int Maze::TraverseMaze(int intsecvalue)
//0 denote for no availble road exist
{
 if(intsecvalue>0)
{if(intsecvalue==EXIT)
 {cout<   return 1;
 }
//go to left
 else if(TraverseMaze(intsec[intsecvalue].left))
 {cout<   return 1;
 }

 else if(TraverseMaze(intsec[intsecvalue].forward))
 {cout<   return 1;
 }

 else if(TraverseMaze(intsec[intsecvalue].right))
 {cout<   return 1;
 }
}
 return 0;
}
#endif

#include "maze.h"
void main()
{char filename[32];
 //string filename;
 cout<<"enter the data file name:";
  cin>>filename;
 Maze M(filename);
 if(M.TraverseMaze(1))
  cout<   else cout< }

6
0 2 0
3 5 6
0 0 4
0 0 0
0 0 0
7 0 0
7