迷宫的递归算法c++

可以找到所有的路径

 

 

#include <iostream> #include <stack> using namespace std; struct Node { int x; int y; bool visit; int value; }matrix[ 2 ][ 2 ]; int sum = 0; int nearest = 100; stack< Node > s; void print( stack< Node > s, int endx, int endy ) { sum ++; cout << "ans " << sum << " :"; stack< Node > t; while( !s.empty() ) { t.push( s.top() ); s.pop(); } while( !t.empty() ) { Node n = t.top(); cout << "( " << n.x << ", " << n.y << " ) -> "; s.push( n ); t.pop(); } cout << "( " << endx << ", " << endy << " )"; cout << endl; } bool isVaild( int x ) { return ( x >= 0 &a