用floyd模板套一套就可以 ..
#include "stack"
#include "cstdio"
#include "iostream"
#include "cmath"
#include "set"
#include "sstream"
#include "cctype"
#include "string"
#include "cstring"
#include "algorithm"
#include "queue"
//#include "map"
using namespace std;
#define LL long long
#define inf 0x3f3f3f3f
#define pa pair<int,int>
#define pi 3.1415926535897932384626433832795028841971
const int M=105;
int dis[M][M];
int main ()
{
int i,j,k;
int n,m;
int st,en;
while(~scanf("%d%d%d",&n,&st,&en))
{
for (i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
{
dis[i][j]=inf;
}
}
for(i=1;i<=n;++i)
{
scanf("%d",&m);
for(j=0;j<m;j++)
{
scanf("%d",&k);
if(j==0) //第一个相连不用手动改道
dis[i][k]=0;
else
dis[i][k]=1;
}
}
for (k=1;k<=n;k++)
{
for (i=1;i<=n;i++)
{
for (j=1;j<=n;j++)
{
if (dis[i][j]>dis[i][k]+dis[k][j])
{
dis[i][j]=dis[i][k]+dis[k][j];
}
}
}
}
if(dis[st][en]==inf)
printf("-1\n");
else
printf("%d\n",dis[st][en]);
}
return 0;
}