bfs poj3984

#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <iostream>
#include <istream>
#include <ostream>
#include <string>
#include <cmath>
#include <ctype.h>
#include <stack>
#include <queue>
#include <map>
#include <set>
/*---------------------------------------------------------------------------------------------------------------*/
using namespace std;
/*---------------------------------------------------------------------------------------------------------------*/
#define maxn 1000000
#define eps 1e-8
int cnt;
int mat[6][6];
int pre[50];
int vis[50];
int sta[100];
int kk[100];
void bfs()
{
    int front=0,rear=1;
    vis[0]=1;
    sta[0]=0;
    while(front<rear)
    {
        vis[sta[front]]=1;
        if(sta[front]==24) break;
        int pos=sta[front];
        if(pos+5<=24&&vis[pos+5]==0&&mat[(pos+5)/5][(pos+5)%5]==0) {sta[rear++]=pos+5;pre[pos+5]=pos;}
        if(pos+1<=24&&pos%5-4!=0&&vis[pos+1]==0&&mat[(pos+1)/5][(pos+1)%5]==0) {sta[rear++]=pos+1;pre[pos+1]=pos;}
        if(pos-1>=0&&pos%5!=0&&vis[pos-1]==0&&mat[(pos-1)/5][(pos-1)%5]==0)  {sta[rear++]=pos-1;pre[pos-1]=pos;}
        if(pos-5>=0&&vis[pos-5]==0&&mat[(pos-5)/5][(pos-5)%5]==0)  {sta[rear++]=pos-5;pre[pos-5]=pos;}
        front++;
    }
}
void print()
{
    int x=24;
    cnt=1;
    while(x!=pre[x]) {kk[cnt++]=pre[x];x=pre[x];} kk[0]=24;
    for(int i=cnt-1;i>=0;i--) printf("(%d, %d)\n",kk[i]/5,kk[i]%5);
}
int main()
{
    cnt=0;
    for(int i=0;i<25;i++) pre[i]=i;
    for(int i=0;i<5;i++)
        for(int j=0;j<5;j++)
            scanf("%d",&mat[i][j]);
    bfs();
    print();
    return 0;
    
}

代码如上文

bfs的写法就是通过fifo表进行访问节点和扩展节点，要先扩展，再访问