Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <fstream>
- using namespace std;
- ifstream f("graful.in");
- int a[20][20], viz[20],c[20];
- int n, x, p, u, comp;
- void citire(int a[20][20], int&n){
- int i, j;
- f>>n;
- while(f>>i>>j) {a[i][j]=a[j][i]=1;}}
- void bfs(int x)
- {int i;
- comp++;
- p=u=1;
- c[p]=x;
- viz[x]=1;
- cout<<x<<" ";
- while(p<=u)
- {
- for(i=1; i<=n; i++)
- if(a[c[p]][i]==1 && !viz[i]) {
- u++;
- c[u]=i;
- viz[i]=1;
- cout<<i<<" ";}
- p++;}
- }
- int am_nod_nevizitat()
- {
- int i;
- for(i=1; i<=n; i++)
- if(!viz[i]) return i;
- return 0;
- }
- int main(){
- cout<<"dati nod pornire ";cin>>x;
- citire(a, n);
- bfs(x);
- while(am_nod_nevizitat())
- {
- x=am_nod_nevizitat();
- bfs(x);}
- return 0;}
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement