最短路之Dijkstra

最短路径之单源Dijkstra算法例子，包括记录路径的操作

// File Name: dijkstra_jilulujin.cpp
// Author: bo_jwolf
// Created Time: Thursday, May 09, 2013 PM07:56:22 HKT

#include<vector>
#include<list>
#include<map>
#include<set>
#include<deque>
#include<stack>
#include<queue>
#include<bitset>
#include<algorithm>
#include<functional>
#include<numeric>
#include<utility>
#include<sstream>
#include<iostream>
#include<iomanip>
#include<cstdio>
#include<cmath>
#include<cstdlib>
#include<cstring>
#include<ctime>

using namespace std;
#define INF 10000000
#define MAXN 20
int n ;
int Edge[ MAXN ][ MAXN ] ;
int S[ MAXN ] ;
int dist[ MAXN ] ;
int path[ MAXN ] ;
void Dijkstra( int v0 )
{
	int i , j , k ;
	for( i = 0 ; i < n ; i++ )
	{
		dist[ i ] = Edge[ v0 ][ i ] ;
		S[ i ] = 0 ;
		if( i != v0 && dist[ i ] < INF )
			path[ i ] = v0 ;
		else
			path[ i ] = -1 ;
	} 
	S[ v0 ] = 1 ;
	dist[ v0 ] = 0 ;
	for( i = 0 ; i < n - 1 ; i++ )
	{
		int min = INF ;
		int u = v0 ;
		for( j = 0 ; j < n ; j++ )
		{
			if( !S[ j ] && dist[ j ] < min )
			{
				u = j ;
				min = dist[ j ] ;
			}
		}
		S[ u ] = 1 ;
		for( k = 0 ; k < n ; k++ )
		{
			if( !S[ k ] && Edge[ u ][ k ] < INF && dist[ u ] + Edge[ u ][ k ] < dist[ k ] )
			{
				dist[ k ] = dist[ u ] + Edge[ u ][ k ] ;
				path[ k ] = u ;
			}
		}
	}
}


int main()
{
	int i , j ;
	int u , v , w ;
	scanf( "%d" , &n ) ;
	while( 1 )
	{
		scanf( "%d%d%d" ,&u , &v , &w ) ;
		if( u == -1 && v == -1 && w == -1 )
			break ;
		Edge[ u ][ v ] = w;
	}
	for( i = 0 ; i < n ; i++ )
	{
		for( j = 0 ; j < n ; j++ )
		{
			if( i == j )
				Edge[ i ][ j ] = 0 ;
			else
				if( Edge[ i ][ j ] == 0 )
					Edge[ i ][ j ] = INF ;
		}
	}
	Dijkstra( 0 ) ;
	int shortest[ MAXN ] ;
	for( i = 1 ; i < n ; i++ )
	{
		printf( "%d\t" , dist[ i ] ) ;
		memset( shortest , 0 , sizeof( shortest ) ) ;
		int k = 0 ;
		shortest[ k ] = i ;
		while( path[ shortest[ k ] ] != 0 )
		{
			k++;
			shortest[ k ] = path[ shortest[ k - 1 ] ] ;
		}
		k++ ;
		shortest[ k ] = 0 ;
		for( j = k ; j > 0 ; j-- )
			printf( "%d-->" , shortest[ j ] ) ;
		printf( "%d\n" , shortest[ 0 ] ) ;
	}
	return 0;
}