关于c++ 迷宫问题！！！

回朔法

/* 迷宫问题的递归算法*/
#include <stdio.h>
#include <stdlib.h>
#define M 8
#define N 11
/* 迷宫maze[M][N]中求从入口maze[x1][y1]到出口maze[x2][y2]的一条路径 */
/* 其中 1<=x1,x2<=M-2 , 1<=y1,y2<=N-2 */
int mazePath(int* maze[], int* direction[], int x1, int y1, int x2, int y2) {
int k,g,h;
for (k = 0; k < 4; k++) {
g = x1 + direction[k][0];
h = y1 + direction[k][1];
if (g == x2 && h == y2 && maze[g][h] == 0) { /* 找到路径*/
printf("The revers path is:/n");
printf("the node is: %d %d/n",x2,y2);
printf("the node is: %d %d/n",x1,y1);
return 1;
}
if(maze[g][h] == 0) {
maze[g][h] = 2;
if (mazePath(maze, direction, g, h, x2, y2) == 1) {/*如能找到路径*/
printf(&quo