Algorithms/Dijsktra.cpp at master · priya2006/Algorithms · GitHub

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
67
68
69
70
71
72
73
74
75
76
77
78
79
80
#include<bits/stdc++.h>
using namespace std;

int minimundist(int *dis,bool *ch,int v)
{
    int min=INT_MAX,m_index;
    for(int i=0;i<v;i++)
    {
        if(ch[i]==false && dis[i]<=min)
        {
            min=dis[i];
            m_index=i;
        }
    }
    return m_index;
}
void display(int *distance,int v)
{
    cout<<"vertex \t shortest distance from source(0)\n";
    for(int i=0;i<v;i++)
    {
        cout<<i<<"\t"<<distance[i]<<"\n";
    }
}
void dijsktra(int g[][],int src,int v)
{
   int d[v];
   bool check[v];

   for(int i=0;i<v;i++)
   {
       d[i]=INT_MAX;
       check[i]=false;
   }

   d[src]=0;

   for(int j=0;j<v-1;j++)
   {
       int u;
       u=minimundist(d,check,v);
  //cout<<u<<" ";
       check[u]=true;
       for(int i=0;i<v;i++)
       {
       if(!check[i]&&d[u]!=INT_MAX  && g[u][i]&&d[u]+g[u][i]<d[i])
       d[i]=d[u]+g[u][i];
       }
   }
   display(d,v);
}
int main()
{
    int v;
    cout<<"No. of vertices:";
    v=6;
         int grph[6][6];
    // int grph[v][v]={ { 0, 4, 0, 0, 0, 0, 0, 8, 0 },
	// 					{ 4, 0, 8, 0, 0, 0, 0, 11, 0 },
	// 					{ 0, 8, 0, 7, 0, 4, 0, 0, 2 },
	// 					{ 0, 0, 7, 0, 9, 14, 0, 0, 0 },
	// 					{ 0, 0, 0, 9, 0, 10, 0, 0, 0 },
	// 					{ 0, 0, 4, 14, 10, 0, 2, 0, 0 },
	// 					{ 0, 0, 0, 0, 0, 2, 0, 1, 6 },
	// 					{ 8, 11, 0, 0, 0, 0, 1, 0, 7 },
	// 					{ 0, 0, 2, 0, 0, 0, 6, 7, 0 } };

     int edges,x,y,w;
     cin>>edges;
     for(int  i=0;i<edges;i++)
     {
         cin>>x>>y>>w;
         grph[x][y]=w;
         grph[y][x]=w;
     }

    dijsktra(grph,0,v);

    return 0;
}