-
Notifications
You must be signed in to change notification settings - Fork 0
/
Dijkstra.cpp
66 lines (60 loc) · 1.16 KB
/
Dijkstra.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
#include<iostream>
using namespace std;
int N;
int graph[20][20];
int minDist(int dist[],bool flag[])
{
int min=1000,min_index;
for(int v=0;v<N;v++)
{
if(flag[v]==false&&dist[v]<min)
{
min=dist[v];
min_index=v;
}
}
return min_index;
}
void Dijkstra(int src)
{
int dist[N];
bool flag[N];
for(int i=0;i<N;i++)
{
dist[i]=1000;
flag[i]=false;
}
dist[src]=0;
for(int c=0;c<N-1;c++)
{
int u = minDist(dist,flag);
flag[u]=true;
for(int v=0;v<N;v++)
{
if(!flag[v]&&graph[u][v]&&dist[u]!=1000&&dist[u]+graph[u][v]<dist[v])
dist[v]=dist[u]+graph[u][v];
}
}
for(int i=0;i<N;i++)
{
cout<<i<<" "<<dist[i];
}
}
int main()
{
cout<<"Enter Total Vertices:";
cin>>N;
cout<<"Enter Adjacency Matrix:-";
for(int i=0;i<N;i++)
{
for(int j=0;j<N;j++)
{
cin>>graph[i][j];
}
}
int src;
cout<<"Enter Source:";
cin>>src;
Dijkstra(src);
return 0;
}