POJ 1847 (细节很重要的dijkstra)

题意：关于n个点，目的是从a->b最短需要转几次弯。输入第一行是n,a,b;接下来是d1,d2,d… 意思是第i个地点有d1个方向可以转。而到d2不需要转，到后边的是要转1次。

#include<cstdio>
#include<cstring>

#define inf 0x3f3f3f3f

int gragh[100][100];
int visit[100];
int dis[100];
int n,a,b;

int dijkstra()
{
    memset(visit,0,sizeof(visit));
    for(int i = 1;i <= n; i++)
        dis[i] = gragh[a][i];
    visit[a] = true;
    for(int i = 1;i <= n; i++){
        int Min = inf;
        int pos = -1;
        for(int j = 1;j <= n; j++){
            if(visit[j] == 0 && dis[j] < Min){
                pos = j;
                Min = dis[j];
            }
        }
        if(pos == -1)
            break;
        visit[pos] = true;
        for(int j = 1;j <= n; j++){
            if(dis[j] > dis[pos] + gragh[pos][j] && visit[j] == 0)  //理解条件，万变不离其宗
                dis[j] = dis[pos] + gragh[pos][j];
        }
    }
    if(dis[b] == inf) return -1;
    else return dis[b];
}

int main()
{
 //   freopen("in.txt","r",stdin);
    while(scanf("%d%d%d",&n,&a,&b) != EOF) {
        memset(gragh,inf,sizeof(gragh));
        int d1,d2,d;
        for(int i = 1;i <= n; i++){
            scanf("%d",&d1);
            if(d1 == 0)     //注意细节
                continue;

            scanf("%d",&d2);
            gragh[i][d2] = 0;
            d1--;
            while(d1--){
                scanf("%d",&d);
                gragh[i][d] = 1;
            }
        }
        int ans = dijkstra();
        printf("%d\n",ans);
    }
    return 0;
}