Tram（转换为最短路模型）

Description
Tram network in Zagreb consists of a number of intersections and rails connecting some of them. In every intersection there is a switch pointing to the one of the rails going out of the intersection. When the tram enters the intersection it can leave only in the direction the switch is pointing. If the driver wants to go some other way, he/she has to manually change the switch.

When a driver has do drive from intersection A to the intersection B he/she tries to choose the route that will minimize the number of times he/she will have to change the switches manually.

Write a program that will calculate the minimal number of switch changes necessary to travel from intersection A to intersection B.
Input
The first line of the input contains integers N, A and B, separated by a single blank character, 2 <= N <= 100, 1 <= A, B <= N, N is the number of intersections in the network, and intersections are numbered from 1 to N.

Each of the following N lines contain a sequence of integers separated by a single blank character. First number in the i-th line, Ki (0 <= Ki <= N-1), represents the number of rails going out of the i-th intersection. Next Ki numbers represents the intersections directly connected to the i-th intersection.Switch in the i-th intersection is initially pointing in the direction of the first intersection listed.
Output
The first and only line of the output should contain the target minimal number. If there is no route from A to B the line should contain the integer “-1”.
Sample Input
3 2 1
2 2 3
2 3 1
2 1 2
Sample Output
0

就是一个列车从A到B，但是铁路是多向的，就像多掷开关一样，走原来的方向不用改变铁路，走其他方向就要改变一次，问这过程中最少改变的次数。
水题……,就是把最短路的单位变成了改变开关的次数，只要把每条铁路原来连的方向权值是0，其他方向是1，跑一遍最短路就行了。

#include<cstdio>
#include<cstring>
#include<iostream>
#include<queue>
#include<vector>
#include<algorithm>
#include<string>
#include<cmath>
#include<set>
#include<map>
#include<vector>
using namespace std;
typedef long long ll;
const int inf = 0x3f3f3f3f;
const int maxn = 1005;
int head[105],d[105],n;
bool leap[105];
struct Node
{
    int u,v,w,next;
}node[10050];
void add_edge(int u,int v,int w,int tot)
{
    node[tot].u = u;node[tot].v = v;
    node[tot].w = w;
    node[tot].next = head[u];
    head[u] = tot;
}
void spfa(int start)
{
    for(int i = 1;i <= n;i++)leap[i] = false;
    for(int i = 1;i <= n;i++)d[i] = inf;
    d[start] = 0;leap[start] = true;
    queue<int>p;
    p.push(start);
    while(p.size())
    {
        int u = p.front();p.pop();
        leap[u] = false;
        for(int i = head[u];i != -1;i = node[i].next)
        {
            int v = node[i].v;
            if(d[v] > d[u] + node[i].w)
            {
                d[v] = d[u] + node[i].w;
                if(!leap[v])
                {
                    leap[v] = true;p.push(v);
                }
            }
        }
    }
}
int main()
{
    #ifdef LOCAL
    freopen("C:\\Users\\巍巍\\Desktop\\in.txt","r",stdin);
    //freopen("C:\\Users\\巍巍\\Desktop\\out.txt","w",stdout);
    #endif // LOCAL
    int a,b;
    while(scanf("%d%d%d",&n,&a,&b) != EOF)
    {
        int cnt = 1;
        memset(head,-1,sizeof(head));
        for(int i = 1;i <= n;i++)
        {
            int k;
            scanf("%d",&k);
            for(int j = 1;j <= k;j++)
            {
                int x;
                scanf("%d",&x);
                if(j == 1)
                    add_edge(i,x,0,cnt++);
                else
                    add_edge(i,x,1,cnt++);
            }
        }
        spfa(a);
        if(d[b] == inf)
            printf("-1\n");
        else
            printf("%d\n",d[b]);
    }
    return 0;
}