5-5 递归算法求解从入口到出口的全部迷宫路径

//递归算法求解从入口到出口的全部迷宫路径 #include <stdio.h> #define MaxSize 100 #define M 4 #define N 4 int mg[M+2][N+2]= { {1, 1, 1, 1, 1, 1}, {1, 0, 0, 0, 1, 1}, {1, 0, 1, 0, 0, 1}, {1, 0, 0, 0, 1, 1}, {1, 1,

>>阅读原文<<