图结构练习——BFSDFS——判断可达性
#include <bits/stdc++.h>
using namespace std;
int n, m;
int mp[1010][1010], vis[1010];
int DFS(int k);
int main()
{
while(cin >> n >> m)
{
memset(mp, 0, sizeof(mp));
memset(vis, 0, sizeof(vis));
while(m --)
{
int x, y;
cin >> x >> y;
mp[x][y] = 1;
}
DFS(n);
if(vis[1]) {cout << "YES" << endl;}
else {cout << "NO" << endl;}
}
return 0;
}
int DFS(int k)
{
vis[k] = 1;
for(int i = 1; i <= n; i++)
{
if(!vis[i] && mp[k][i])
{
DFS(i);
}
}
return 0;
}