最短路径之Spfa算法

题目：http://acm.nefu.edu.cn/JudgeOnline/problemshow.php?problem_id=208

#include <iostream>
#include <string.h>
#include <stdio.h>
#include <queue>

using namespace std;
const int N = 105;
const int INF = 1<<29;

int map[N][N];
int dist[N];
bool vis[N];
queue<int> Q;

int n,m;

void Spfa(int s)
{
    memset(vis,0,sizeof(vis));
    for(int i=0; i<n; i++)
        dist[i] = INF;
    dist[s] = 0;
    while(!Q.empty()) Q.pop();
    Q.push(s);
    vis[s] = 1;
    while(!Q.empty())
    {
        int u = Q.front();
        vis[u] = 0;
        Q.pop();
        for(int i=0; i<n; i++)
        {
            if(map[u][i] == INF)  continue;
            if(dist[i] > dist[u] + map[u][i])
            {
                dist[i] = dist[u] + map[u][i];
                if(!vis[i])
                {
                    vis[i] = 1;
                    Q.push(i);
                }
            }
        }
    }
}

void Init()
{
    for(int i=0; i<n; i++)
        for(int j=0; j<n; j++)
            map[i][j] = (i == j) ? 0 : INF;
}

int main()
{
    while(cin>>n>>m)
    {
        Init();
        while(m--)
        {
            int u,v,w;
            cin>>u>>v>>w;
            map[u][v] = w;
        }
        int s,t;
        cin>>s>>t;
        Spfa(s);
        if(dist[t] == INF) cout<<"-1"<<endl;
        else cout<<dist[t]<<endl;
    }
    return 0;
}