树的重心://dfs
#include<iostream>
#include<cstring>
using namespace std;
N;
int h[N],en[N],e[N],idx;bool str[N];
void add(int u,int x)
{
e[idx]=x; en[dix]=h[u]; h[u]=dix++;
}
int dfs(int u)
{int sum = 1;ans = N;int res;
str[u]=true;
for(int i = h[u]; i != -1;i=en[i])
{int j = e[i];
if( !str[ j ] ){int s=dfs( j ); sum+=s; res=max(res,s);)}
res = max(res , n-sum);
res = min(res,ans);
return sum;
}
}
bfs:
#include<iostream>
#include<cstring>
#include<algorithm>
using namespace std;
const int N = 100010;
int e[N], en[N], h[N], q[N], idx, d[N];int n,m;
void add(int a, int b)
{
e[idx] = b;
en[idx] = h[a];
h[a] = idx++;
}
int bfs()
{
int tt = 0, hh = 0;
q[0] = 1;
memset(d, -1, sizeof d);
d[1] = 0;
while (hh <= tt)
{
int t = q[hh++];
for (int i = h[t]; i != -1; i = en[i])
{
int j = e[i];
if (d[j] == -1)
{
d[j] = d[t] + 1;
q[++tt] = j;
}
}
}
return d[n];
}
int main()
{
memset(h, -1, sizeof h);
cin >> n >> m;
for (int i = 0; i < m; i++)
{
int a, b;
cin >> a >> b;
add(a, b);
}
cout << bfs();
}