广搜之仙岛求药

当队列为空时，则表示到达不了指定位置

#include <iostream>
#include <memory.h>
#include <string>
#include <stdio.h>
#include <queue>
#include <math.h>
#include <stdlib.h>
using namespace std;
int M,N;
int dx[] = {1,-1,0,0};
int dy[] = {0,0,1,-1};
char Map[25][25];
int visited[25][25];
int beginx,beginy,endx,endy;
struct node
{
    int x,y,step;
    node(int xx = 0, int yy = 0, int ss = 0):x(xx),y(yy),step(ss){}
};
queue <node> q;
int bfs()
{
    q.push( node(beginx, beginy, 0) );
    visited[beginx][beginy] = 1;
    while( !q.empty() )
    {
        node now = q.front();
        q.pop();
        int Nowx = now.x;int Nowy = now.y;int Nowstep = now.step;
        if( now.x == endx && now.y == endy )
            return now.step;
        for( int i = 0; i < 4; i++ )
        {
            if( !visited[Nowx + dx[i]][Nowy + dy[i]] && Map[Nowx + dx[i]][Nowy + dy[i]] != '#' )
            {
                visited[Nowx + dx[i]][Nowy + dy[i]] = 1;
                q.push(node(Nowx + dx[i], Nowy + dy[i], Nowstep+1 ));
            }
        }
    }
    return -1;
}
int main()
{
    while( cin >> M >> N ,M!=0 && N!=0)
    {
        memset(Map, 0, sizeof(Map));
        for( int i = 1; i <= M; i++ )
            for( int j = 1; j <= N; j++ )
        {
            cin >> Map[i][j];
            if( Map[i][j] == '@' )
            {
               beginx = i;
               beginy = j;
            }
            else if( Map[i][j] == '*' )
            {
                endx = i;
                endy = j;
            }
        }
        for( int i = 0; i <= M+1; i++ )
            for( int j = 0; j <= N+1; j++ )
        {
            if( i==0 || j==0 || i==M+1 || j==N+1 )
                Map[i][j] = '#';
        }
        memset(visited, 0, sizeof(visited));
        int Minstep;
        while( !q.empty() )
            q.pop();
        Minstep = bfs();
        cout << Minstep << endl;
    }
    return 0;
}