/*************************************************************************> File Name: Dijkstra.cpp> Author: He Xingjie> Mail: gxmshxj@163.com> Created Time: 2014年06月07日 星期六 22时12分43秒> Description: ************************************************************************/
#include<iostream>
#include<cstdio>using namespace std;#define INF 99999//map矩阵记录路径图，dist[i]表示源点到节点
//i的最短路径,finish[i]表示节点i找到最短路径
//path[i]=j表示从源节点到i节点的最短路径要经过j
int map[100][100], dist[100], finish[100];
int path[100];void Dijkstra(int s, int n)
{
/**s为源点，n为节点的个数*当finish[i]=true时，dist[i]*为s到i的最短路径*假设S为已求得最短路径的终点集合*V为所有节点的集合*/int i, j, v, k;//初始化dist[i]for (i=1; i<n; i++){dist[i] = map[s][i];if (dist[i] < INF)path[i] = s;}//初始化源节点finish[s] = true;dist[s] = 0;for (i=1; i<n; i++)  //总共有n-1个节点
    {int min = INF;for (j=0; j<n; j++)      {//从V-S中(没有找到最短路径的集合)寻找离源节点//距离最近的点if (!finish[j] && dist[j] < min){v = j;min = dist[j];}}//找到最短路径finish[v] = true;    //把节点v加入到S中//松弛(Relax)for (k=0; k<n; k++){if (!finish[k] && map[v][k] != INF)if (dist[k] > dist[v] + map[v][k]){dist[k] = dist[v] + map[v][k];path[k] = v;}}}
}void PrintPath(int k)
{if (k == 0){printf("%d", k);return;}PrintPath(path[k]);printf("->%d", k);
}void PrintMap(int n)
{int i, j;//输出矩阵for (i=0; i<n; i++){for (j=0; j<n; j++){if (map[i][j] == INF)printf("INF ");elseprintf("%d  ", map[i][j]);}printf("\n");}
}int main()
{int n, m, i, j;freopen("input.txt", "r", stdin);cin>>n>>m;    //n是顶点数，m是边数//初始化for (i=0; i<n; i++){finish[i] = false;for (j=0; j<n; j++)map[i][j] = INF;}//输入for(int i=1; i<=m; i++){int i,j;cin>>i>>j;cin>>map[i][j];}/**PrintMap(n);*/Dijkstra(0, n);for (i=1; i<n; i++){printf("Path: ");PrintPath(i);printf("  Dist:%d\n", dist[i]);}return 0;
}