Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <fstream>
- #define INF 1000000
- using namespace std;
- ifstream fin("dijkstra.in");
- ofstream fout("dijkstra.out");
- int nr_noduri, nod_start, graf[101][101];
- int d[101],p[101];
- bool viz[101];
- void citire()
- {
- fin>>nr_noduri>>nod_start;
- int nod1, nod2, cost;
- for(int i=1; i<=nr_noduri; i++)
- for(int j=1; j<i; j++)
- graf[i][j]=graf[j][i]=INF;
- while(fin>>nod1>>nod2>>cost)
- graf[nod1][nod2]=cost;
- }
- void init()
- {
- for(int j=1; j<=nr_noduri; j++)
- {
- d[j]=graf[nod_start][j];
- p[j]=nod_start;
- }
- p[nod_start]=0;
- viz[nod_start]=1;
- }
- void dijkstra()
- {
- int min, poz_min;
- for(int k=1; k<nr_noduri; k++)
- {
- min=INF;
- poz_min=0;
- for(int i=1; i<=nr_noduri; i++)
- if (min>d[i]&&viz[i]==0)
- {
- min=d[i];
- poz_min=i;
- }
- viz[poz_min]=1;
- for(int i=1; i<=nr_noduri; i++)
- if (poz_min!=0&&!viz[i]&&d[i]>d[poz_min]+graf[poz_min][i])
- {
- d[i]= d[poz_min]+graf[poz_min][i];
- p[i]=poz_min;
- }
- }
- }
- /*void afisare(int x)
- {
- if (x!=nod_start)
- afisare(p[x]);
- fout<<x<<" ";
- }*/
- int main()
- {
- citire();
- init();
- dijkstra();
- for(int i=1; i<=nr_noduri; i++)
- if(d[i]!=INF)
- fout<<d[i]<<" ";
- else
- fout<<"-1"<<" ";
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement