BFS 数组模拟队(有向图)

#include<iostream>
using namespace std;


const int Limit = 400,maxinum = 10000;


int data[Limit][Limit],visited[Limit];
int N,S,T;
int queue[Limit];


bool BFS(int S,int m){
    int i,open = 1,closed = 1;
    visited[S] = 0;
    queue[1] = S;
    while(open <= closed)
    {
               for( i = 1 ; i <= N ; i++ )
               if( visited[i] == -1 && data[queue[open]][i] != 0 )
               {
                   visited[i] = visited[queue[open]] + 1;
                   queue[++closed] = i;
               }
               ++open;
    }
    return !(visited[m] == -1);
}


int main()
{
    int a,b;
    N = 10;
    while(scanf("%d %d",&a,&b) != EOF) data[a][b]=1;
    memset(visited,-1,sizeof(visited));
    if(BFS(1,8))printf("Yes\n");
    else printf("No\n");
    system("pause");
    return 0;
}