题目链接：http://poj.org/problem?id=1847
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 题目大意：有N个站点，站点之间有轨道相连，但是站点同时只连向一个站点，要到该站点可以到的其它站点需要使用转换器，问从A到B需要最少使用多少次转换器解题思路：可以将使用转换器的次数看做两站点的距离，初始化图的时候，该站点直连的站点初始化为0，其它站点初始化为1，然后由于数据量太小，随便一个最短路算法即可
1 #include<iostream>
2 #include<cstring>
3 #include<cmath>
4 #include<algorithm>
5 #include<map>
6 #include<cstdio>
7 #include<queue>
8
9 using namespace std;
10
11 const int INF = 0x3f3f3f3f;
12 int n, a, b;
13 int dis[105][105];
14
15 int main(){
16 ios::sync_with_stdio( false );
17
18 cin >> n >> a >> b;
19 memset( dis, INF, sizeof( dis ) );
20
21 int k, to;
22 for( int i = 1; i <= n; i++ ){
23 dis[i][i] = 0;
24 cin >> k;
25 for( int t = 0; t < k; t++ ){
26 cin >> to;
27 if( t == 0 ) dis[i][to] = 0;
28 else dis[i][to] = 1;
29 }
30 }
31
32 for( int j = 1; j <= n; j++ ){
33 for( int i = 1; i <= n; i++ ){
34 for( int k = 1; k <= n; k++ ){
35 dis[i][k] = min( dis[i][k], dis[i][j] + dis[j][k] );
36 }
37 }
38 }
39
40 if( dis[a][b] == INF ) cout << -1;
41 else cout << dis[a][b];
42 cout << endl;
43 }