（Dijstra + 优先队列，Floyd，BellmanFord，SPFA）HDU-1874

http://blog.csdn.net/u011742541/article/details/12916609

某省自从实行了很多年的畅通工程计划后，终于修建了很多路。不过路多了也不好，每次要从一个城镇到另一个城镇时，都有许多种道路方案可以选择，而某些方案要比另一些方案行走的距离要短很多。这让行人很困扰。

现在，已知起点和终点，请你计算出要从起点到终点，最短需要行走多少距离。

 

Input

本题目包含多组数据，请处理到文件结束。
每组数据第一行包含两个正整数N和M(0<N<200,0<M<1000)，分别代表现有城镇的数目和已修建的道路的数目。城镇分别以0～N-1编号。
接下来是M行道路信息。每一行有三个整数A,B,X(0<=A,B<N,A!=B,0<X<10000),表示城镇A和城镇B之间有一条长度为X的双向道路。
再接下一行有两个整数S,T(0<=S,T<N)，分别代表起点和终点。

 

Output

对于每组数据，请在一行里输出最短需要行走的距离。如果不存在从S到T的路线，就输出-1.

 

Sample Input

   
   

    
    3 3
0 1 1
0 2 3
1 2 1
0 2
3 1
0 1 1
1 2
   
   

 

Sample Output

   
   

    
    2
-1
   
   
   
   


   
   

Dijstra + 优先队列：

#include<stdio.h>
#include<string.h>
#include<queue>
using namespace std;
const int maxn = 205;
const int inf = 1<<28;
int n,m;
int map[maxn][maxn],dis[maxn];
bool vis[maxn];
typedef pair<int,int>pii;
void Dijstra( int x )
{
    priority_queue<pii,vector<pii>,greater<pii> >que;
    memset( vis,0,sizeof(vis) );
    for( int i = 0; i < n; i ++ )
        dis[i] = inf;
    dis[x] = 0;
    que.push( make_pair(dis[x],x) );
    while( !que.empty() )
    {
        pii u = que.top(); que.pop();
        int v = u.second;
        if( vis[v] )
            continue;
        vis[v] = true;
        for( int i = 0; i < n; i ++ )
        {
            if( map[v][i] != inf && dis[i] > dis[v] + map[v][i] )
            {
                dis[i] = dis[v] + map[v][i];
                que.push( make_pair( dis[i],i ) );
            }
        }
    }
}

int main()
{
    //freopen( "data.in","r",stdin );
    int a,b,c;
    while( scanf("%d%d",&n,&m) != EOF )
    {
        for( int i = 0; i < n; i ++ )
        {
            for( int j = 0; j < n; j ++  )
            {
                map[i][j] = inf;
            }
        }
        for( int i = 1; i <= m; i ++ )
        {
            scanf("%d%d%d",&a,&b,&c);
            if( c < map[a][b] )
                map[a][b] = map[b][a] = c;
        }

        scanf("%d%d",&a,&b);
        Dijstra(a);
        if( dis[b] == inf )
            puts("-1");
        else
            printf("%d\n",dis[b]);
    }
	return 0;
}

Floyd：

#include<stdio.h>
#include<string.h>
const int maxn = 205;
const int inf = 1<<28;
int n,m;
int dis[maxn][maxn];

void Floyd()
{
    for( int k = 0; k < n; k ++ )
    {
        for( int i = 0; i < n; i ++ )
        {
            for( int j = 0; j < n; j ++ )
            {
                if( dis[i][j] > dis[i][k] + dis[k][j] )
                    dis[i][j] = dis[i][k] + dis[k][j];
            }
        }
    }
}

int main()
{
    //freopen( "data.in","r",stdin );
    int a,b,c;
    while( scanf("%d%d",&n,&m) != EOF )
    {
        for( int i = 0; i < n; i ++ )
        {
            for( int j = 0; j < n; j ++ )
            {
                if( i == j )
                    dis[i][j] = 0;
                else
                    dis[i][j] = inf;
            }
        }
        for( int i = 1; i <= m; i ++ )
        {
            scanf("%d%d%d",&a,&b,&c);
            if( c < dis[a][b] )
                dis[a][b] = dis[b][a] = c;
        }
        Floyd();
        scanf("%d%d",&a,&b);
        if( dis[a][b] == inf )
            puts("-1");
        else
            printf("%d\n",dis[a][b]);
    }
    return 0;
}

BellmanFord：

#include<stdio.h>
#include<string.h>
#include<vector>
#include<queue>
using namespace std;
const int maxn = 210;
const int inf = 1<<29;
int n,m;
int dis[maxn];
struct node
{
    int id,w;
    node( int a,int b ) { id = a; w = b; }
};
vector<node>map[maxn];

bool BellmanFord( int s )
{
    for( int i = 0; i < n; i ++ )
        dis[i] = inf;
    dis[s] = 0;
    for( int i = 0; i < n-1; i ++ )  //n-1次松弛
    {
        for( int j = 0; j < n; j ++ )
        {
            if( dis[j] == inf )
                continue;
            for( int k = 0; k < map[j].size(); k ++ )
            {
                node u = map[j][k];
                if( u.w != inf && dis[u.id] > dis[j] + u.w )
                    dis[u.id] = dis[j] + u.w;
            }
        }
    }
    for( int j = 0; j < n; j ++ )
    {
        if( dis[j] == inf )
            continue;
        for( int k = 0; k < map[j].size(); k ++ )
        {
            node u = map[j][k];
            if( u.w != inf && dis[u.id] > dis[j] + u.w )
                return false;
        }
    }
    return true;
}

int main()
{
    //freopen("data.txt","r",stdin);
    int a,b,c;
    while( scanf("%d%d",&n,&m) == 2 )
    {
        for( int i = 0; i <= n; i ++ )
            map[i].clear();
        for( int i = 1; i <= m; i ++ )
        {
            scanf("%d%d%d",&a,&b,&c);
            map[a].push_back( node(b,c) );
            map[b].push_back( node(a,c) );
        }
        scanf("%d%d",&a,&b);
        if( BellmanFord( a ) )//判断是否有负环
        {
            if( dis[b] != inf )
                printf( "%d\n",dis[b] );
            else
                puts("-1");
        }
    }
    return 0;
}

SPFA：

//SPEA
#include<stdio.h>
#include<string.h>
#include<vector>
#include<queue>
using namespace std;
const int maxn = 210;
const int inf = 1<<29;
int n,m;
int dis[maxn],outque[maxn],vis[maxn];
struct node
{
    int id,w;
    node( int a,int b ) { id = a; w = b; }
};
vector<node>map[maxn];

bool SPEA( int s )
{
    queue<int>que;
    memset( outque,0,sizeof(outque) );
    memset( vis,0,sizeof(vis) );
    for( int i = 0; i < n; i ++ )
        dis[i] = inf;
    dis[s] = 0;
    que.push( s );
    vis[s] = true;
    while( !que.empty() )
    {
        int x = que.front(); que.pop();
        vis[x] = false;
        outque[x] ++;
        if( outque[x] > n )
            return false;
        for( int i = 0; i < map[x].size(); i ++ )
        {
            node u = map[x][i];
            if( u.w != inf && dis[u.id] > dis[x] + u.w )
            {
                dis[u.id] = dis[x] + u.w;
                if( !vis[u.id] )
                {
                    vis[u.id] = true;
                    que.push( u.id );
                }
            }
        }
    }
    return true;
}

int main()
{
    //freopen("data.txt","r",stdin);
    int a,b,c;
    while( scanf("%d%d",&n,&m) == 2 )
    {
        for( int i = 0; i <= n; i ++ )
            map[i].clear();
        for( int i = 1; i <= m; i ++ )
        {
            scanf("%d%d%d",&a,&b,&c);
            map[a].push_back( node(b,c) );
            map[b].push_back( node(a,c) );
        }
        scanf("%d%d",&a,&b);
        if( SPEA( a ) )
        {
            if( dis[b] != inf )
                printf( "%d\n",dis[b] );
            else
                puts("-1");
        }
        else
        {
            puts("0");
        }
    }
    return 0;
}