Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include<iostream>
- #include<fstream>
- using namespace std;
- int a[20][20],c[20],v[20],ns,n,comp;
- int prim;
- int ultim;
- int citire(int a[20][20], int &n)
- { ifstream f("graf.in");
- int x,y;
- f>>n;
- while(f>>x>>y)
- a[x][y]=a[y][x]=1;
- f.close();
- }
- int exista_nod_nevizitat(int v[20], int n)
- { for(int i=1;i<=n;i++)
- if(v[i]==0)
- return i; // primul nod nevizitat
- return 0; // nu mai exista noduri nevizitate
- }
- int parcurgere_latime(int a[20][20], int n,int ns)
- { comp++;
- v[ns]=1;
- prim=ultim=1;
- c[ultim]=ns;
- while(prim<=ultim)
- {for(int i=1;i<=n;i++)
- if(a[c[prim]][i]==1)
- if(v[i]==0)
- { ultim++;
- c[ultim]=i;
- v[i]=1;
- }
- prim++;
- }
- cout<<endl;
- }
- int afisare(int a[20][20],int n)
- { cout<<"Matricea de adiacenta este : "<<endl;
- for( int i=1;i<=n;i++)
- { for(int j=1;j<=n;j++)
- cout<<a[i][j]<<" ";
- cout<<endl;
- }
- }
- int main()
- { citire(a,n);
- afisare(a,n);
- parcurgere_latime(a,n,1);
- if (exista_nod_nevizitat(v,n)!=0)
- cout<<"Graful NU este conex!";
- else
- cout<<"Graful este conex!";
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement