Scribd
Upload
4 views3 pages

Djikstra

Uploaded by

Isha Velankar
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
4 views3 pages

Djikstra

Uploaded by

Isha Velankar
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 3

#include <iostream>

#include <climits>

using namespace std;

int findminvertex(int *distance,bool *visited , int n)

int minvertex=-1;

for(int i=0;i<n;i++)

if(!visited[i] && (minvertex==-1 || distance[i]<distance[minvertex]))

minvertex=i;

return minvertex;

void dijkstras(int**edges,int n)

int *distance=new int[n];

bool *visited=new bool[n];

for(int i=0;i<n;i++)

distance[i]=INT_MAX;

visited[i]=false;

distance[0]=0;

for(int i=0;i<n-1;i++)

int minvertex=findminvertex(distance,visited,n);

visited[minvertex]=true;
for(int j=0;j<n;j++)

if(edges[minvertex][j]!=0 && !visited[j])

int dist=distance[minvertex]+edges[minvertex][j];

if(dist<distance[j])

distance[j]=dist;

for(int i=0;i<n;i++)

cout<<i<<" "<<distance[i]<<endl;

delete [] visited;

delete [] distance;

int main()

int n;

int e;

cin>>n>>e;

int **edges=new int*[n];

for(int i=0;i<n;i++)

{
edges[i]=new int[n];

for(int j=0;j<n;j++)

edges[i][j]=0;

for(int i=0;i<e;i++)

int f,s,weight;

cin>>f>>s>>weight;

edges[f][s]=edges[s][f]=weight;

cout<<endl;

dijkstras(edges,n);

for(int i=0;i<n;i++)

delete [] edges[i];

delete [] edges;

You might also like