|
| 1 | +#include<iostream> |
| 2 | +#include<climits> |
| 3 | +using namespace std; |
| 4 | +int findMinVertex(int *distance,bool *visited,int n){ |
| 5 | + int minVertex=-1; |
| 6 | + for(int i=0;i<n;i++){ |
| 7 | + if(!visited[i]&&(minVertex==-1||distance[i]<distance[minVertex])){ |
| 8 | + minVertex=i; |
| 9 | + } |
| 10 | + } |
| 11 | + return minVertex; |
| 12 | +} |
| 13 | +void dijkstras(int **edges,int n){ |
| 14 | + int *distance=new int[n]; |
| 15 | + bool *visited=new bool[n]; |
| 16 | + for(int i=0;i<n;i++){ |
| 17 | + distance[i]=INT_MAX; |
| 18 | + visited[i]=false; |
| 19 | + } |
| 20 | + distance[0]=0; |
| 21 | + for(int i=0;i<n-1;i++){ |
| 22 | + int minVertex=findMinVertex(distance,visited,n); |
| 23 | + visited[minVertex]=true; |
| 24 | + for(int j=0;j<n;j++){ |
| 25 | + if(edges[minVertex][j]!=0&&!visited[j]){ |
| 26 | + if(distance[minVertex]+edges[minVertex][j]<distance[j]){ |
| 27 | + distance[j]=distance[minVertex]+edges[minVertex][j]; |
| 28 | + } |
| 29 | + } |
| 30 | + } |
| 31 | + } |
| 32 | + for(int i=0;i<n;i++){ |
| 33 | + cout<<i<<" "<<distance[i]<<endl; |
| 34 | + } |
| 35 | + delete [] visited; |
| 36 | + delete [] distance; |
| 37 | +} |
| 38 | +int main(){ |
| 39 | + int n,e; |
| 40 | + cin>>n>>e; |
| 41 | + int **edges=new int*[n]; |
| 42 | + for(int i=0;i<n;i++){ |
| 43 | + edges[i]=new int[n]; |
| 44 | + for(int j=0;j<n;j++){ |
| 45 | + edges[i][j]=0; |
| 46 | + } |
| 47 | + } |
| 48 | + for(int i=0;i<e;i++){ |
| 49 | + int f,s,w; |
| 50 | + cin>>f>>s>>w; |
| 51 | + edges[f][s]=w; |
| 52 | + edges[s][f]=w; |
| 53 | + } |
| 54 | + cout<<endl; |
| 55 | + dijkstras(edges,n); |
| 56 | + for(int i=0;i<n;i++){ |
| 57 | + delete [] edges[i]; |
| 58 | + } |
| 59 | + delete [] edges; |
| 60 | + return 0; |
| 61 | +} |
0 commit comments