Dijkstra算法代码

今天写了Dijkstra单源最短路径的代码，贴出来...

 

 #include "stdafx.h"#include <limits>#include <iostream>#include <fstream>using namespace std;const int MAXINT = numeric_limits<int>::max(); template <class Type>void Dijkstra(int n, int v, Type dist[], int prev[], Type** c){bool *s = new bool[n+1];int i, j;for(i = 1; i <=n; i++){ dist[i] = c[v][i]; if(c[v][i]!=MAXINT) prev[i] = v; else prev[i] =0; s[i] = false;}s[v] = true;dist[v] = 0;prev[v] = 0;for(i = 1; i< n; i++){int u = v;int temp = MAXINT;for( j = 1; j<=n; j++)if(!s[j]&&dist[j]<temp){u = j;temp = dist[j];}s[u] = true;for(j=1; j<=n; j++){if((!s[j])&&c[u][j]<MAXINT){if((dist[u]+c[u][j])<dist[j]){dist[j] = dist[u] + c[u][j];prev[j] = u;}}}}delete [] s;}void djpath(int m, int v, int prev[]){int i = m ,j =1;while(i!=0){if (j == 1){cout<< i;j = 0;}else cout<< "-" << i;i = prev[i];}cout<<endl;}int _tmain(int argc, _TCHAR* argv[]){cout<<"最大整数:"<<MAXINT<<endl;int prev[6], dist[6];int i,j,n;int** myc; FILE *fp;fp=fopen("data.txt", "r"); fscanf(fp,"%d", &n);myc = new int* [n+1];for(i =0; i<=n; i++)myc[i] = new int[n+1];for(i=1; i<=n; i++)for(j =1; j<=n; j++){fscanf(fp, "%d",&myc[i][j]);if (myc[i][j]==-1)myc[i][j] = MAXINT;} Dijkstra(5, 1, dist, prev, myc);for(i = 1; i<=5; i++)cout<<dist[i]<<endl;for(i=2; i<=5; i++)djpath(i,1,prev);for(i = 0; i<=5; i++)delete[] myc[i];delete [] myc;return 0;}

 

输入数据采用文本文件格式，下面是data.txt的内容

50 10 -1 30 10010 0 50 -1 -1-1 50 0 20 1030 -1 20 0 60100 -1 10 60 0