UVA - 567 - Risk

题目链接：http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=116&page=show_problem&problem=508

/*题目比较简单，就是BFS求最短路，使用邻接表存储图。
注意根据题目要求输出。*/
#include<stdio.h>
#include<string.h>
#define OUT freopen("567out.txt","w",stdout)
typedef struct no{
    int node;
    int next;
}La;
La adjL[1000];//邻接表 
int nCount,d[1000],queue[10000],u[30],vis[30];
int Query(int s,int t)/*BFS求源点到终点距离*/
{
    int front,rear,pos,temp,nearNode;
    memset(d,0,sizeof(d));
    memset(vis,0,sizeof(vis));
    front=rear=0;
    queue[front++]=s;
    vis[s]=1;
    while(rear<front)
    {
        temp=queue[rear++];
        pos=u[temp];
        while(pos!=-1)
        {
            nearNode=adjL[pos].node;
            if(!vis[nearNode])
            {
                queue[front++]=nearNode;
                d[nearNode]=d[temp]+1;
                vis[nearNode]=1;
            }    
            if(nearNode==t)return d[nearNode];
            pos=adjL[pos].next;
        }
    }  
    return -1;            
}    
int main()
{
    int n,i,j,k,v,step=1,start,end,test=0; 
    nCount=0;
    memset(u,-1,sizeof(u));
    while(scanf("%d",&n)!=EOF)//由于输入是从第一个结点开始的，所以step表示当前结点 
    {
        if(step<20)
        {
            for(i=0;i<n;i++)
            {
                scanf("%d",&v);
                adjL[nCount].node=v;
                adjL[nCount].next=u[step];
                u[step]=nCount++;
                adjL[nCount].node=step;
                adjL[nCount].next=u[v];
                u[v]=nCount++;
            }
            step++;
        }
        else
        {
            printf("Test Set #%d\n",++test);
            for(i=0;i<n;i++)
            {
                scanf("%d%d",&start,&end);
                printf("%2d to %2d: %d\n",start,end,Query(start,end));
            }
            printf("\n");
            nCount=0;
            step=1;
            memset(u,-1,sizeof(u));
        } 
    }
    return 0;
}