程序把迷宫问题设计成一个类，其数据成员有路口个数mazeSize，出口Exit和路口集合*intSec，构造函数读入已存在的数据文件构造描述一个具体问题的迷宫类的对象；其搜索函数TravMaze(int intSecV)的输入参数intSecV为当前所处的路口，搜索函数用回溯法搜索迷宫的所有分支-maze procedure, the design problem into a category of its data members junctions number mazeSize, export Exit and junctions pool * intSec, Constructors has read the data file structure descr iption of a specific category of objects maze; Its search function TravMaze (int intSecV) input parameters intSecV now in the middle of the intersection, search function is backtracking search all branches of the maze