#include<iostream>
#include<queue>
using namespace std;
const int Limit = 400,maxinum = 10000;
int data[Limit][Limit],visited[Limit]; //data[][]为图的邻接矩阵 visited[i]用于记录起源点到点i的最短路径长度;
int N,S,T;
queue<int>Q;
int BFS(int S,int m){ //判断从起源点S开始是否可到达点m;
int i;
visited[S] = 0;
Q.push(S);
while(!Q.empty())
{
for(i = 1 ; i <= N ; i++ )
if(visited[i] == -1 && data[Q.front()][i] != 0)//在邻接矩阵中找到与队首元素有关系的所有点,压入队中;
{
visited[i] = visited[Q.front()] + 1; //记录起源点到点i的最短路径长度
Q.push(i);
}
Q.pop();
}
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;
}
#include<queue>
using namespace std;
const int Limit = 400,maxinum = 10000;
int data[Limit][Limit],visited[Limit]; //data[][]为图的邻接矩阵 visited[i]用于记录起源点到点i的最短路径长度;
int N,S,T;
queue<int>Q;
int BFS(int S,int m){ //判断从起源点S开始是否可到达点m;
int i;
visited[S] = 0;
Q.push(S);
while(!Q.empty())
{
for(i = 1 ; i <= N ; i++ )
if(visited[i] == -1 && data[Q.front()][i] != 0)//在邻接矩阵中找到与队首元素有关系的所有点,压入队中;
{
visited[i] = visited[Q.front()] + 1; //记录起源点到点i的最短路径长度
Q.push(i);
}
Q.pop();
}
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;
}