main.cpp

用递归算法和非递归算法实现的简单的“迷宫”程序

#include "hello.h"
#include <iostream>
using namespace std;

int main()
{
	Maze M;
	M.PrintPath();       //打印没走前的路径
/////////////////////////

	int m=M.solve(1,1);
	if(m==1)    //求解迷宫
	{
	cout<<endl<<endl<<"The recurve path is following:"<<endl;
	M.PrintPath();       //打印路径
	}
	else
		cout<<"The is no path in the Maze!"<<endl;
		
/////////////////////////
	Maze M1;
	int n=M1.no_recurve(1,1);
	if(n==1)    //求解迷宫
	{
	cout<<endl<<endl<<"The no_recurve path is following:"<<endl;
	M1.PrintPath();       //打印路径
	}
	else
		cout<<"The is no path in the Maze!"<<endl;

	
	return 0;
}