migong

代码说明：

   VC实现迷宫问题,用穷举法找出一条路径,用递归形式的算法求得迷宫中所有可能的通路,以方阵形式输出迷宫及其通路. (VC to achieve maze problems,and use brute-force method to find a path,using the recursive form of algorithm to seek all possible paths in the maze in order to form the output matrix and the path maze.)