Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- /* Trebuie sa se construiasca o retea de autostrazi care sa lege cele mai importante orase din tara. Fiecare tronson de autostrada care leaga doua oras e are un cost de construire. Sa se determine reteaua de autostrazi astfel incat toate orasele sa fie legate prin autostrazi si costul construirii ei sa fie minim. */
- #include <iostream>
- #include <string.h>
- #include <fstream>
- using namespace std;
- ifstream f("graf.txt");
- int a[100][100],n,m,c[100][100],t[100],s[100],p[100],v1,v2,sum;
- char o[100][30],nume[30];
- void citire()
- {
- int p1,p2,z;
- char x[100],y[100];
- f>>n>>m;
- for(int i=1;i<=m;i++)
- for(int j=1;j<=m;j++)
- c[i][j]=32000;
- for(int i=1;i<=n;i++)
- f>>o[i];
- for(int i=1;i<=m;i++)
- {f>>x>>y>>z;
- for(int j=1;j<=n;j++)
- {if(strcmp(o[j],x)==0)
- p1=j;
- if(strcmp(o[j],y)==0)
- p2=j;}
- c[p1][p2]=c[p2][p1]=z;
- }}
- void Prim()
- {
- int f;
- cout<<"Localitatea din care porniti :";
- cin>>nume;
- for(int i=1;i<=n;i++)
- if(strcmp(nume,o[i])==1)
- f=i;
- s[f]=1;
- for(int k=1;k<=n-1;k++)
- {
- int minn=32000;
- for(int i=1;i<=n;i++)
- for(int j=1;j<=n;j++)
- if(c[i][j]<minn && s[i]==1 && s[j]==0)
- {
- minn=c[i][j];
- v1=i;
- v2=j;
- }
- t[v2]=v1;
- s[v2]=1;
- p[v2]=c[v1][v2];
- }
- }
- void afis()
- {
- for(int i=1;i<=n;i++)
- if(t[i]!=0)
- cout<<o[t[i]]<<" "<<o[i]<<endl;
- cout<<"Costul total: ";
- for(int i=1;i<=n;i++)
- sum+=p[i];
- cout<<sum;
- }
- int main()
- {
- citire();
- Prim();
- afis();
- return 0;}
- graf.txt :
- 5 7
- Iasi Deva Cluj Sibiu Arad
- Iasi Deva 10
- Deva Cluj 20
- Sibiu Arad 30
- Arad Iasi 50
- Cluj Arad 60
- Deva Sibiu 45
- Iasi Cluj 5
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement