Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <fstream>
- using namespace std;
- ifstream fin ("BFS.in");
- ofstream fout ("BFS.out");
- int n, m, x, A[101][101], vizit[101];
- void BF(int x)
- {
- int y, i, prim=1, ultim=1, C[101];
- vizit[x]=1; C[1]=x;
- fout<<x<<' ';
- while(prim<=ultim)
- { y=C[prim];
- for(i=1; i<=n; i++)
- if(vizit[i]==0 && A[y][i]==1)
- { vizit[i]=1; ultim ++;
- fout<<i<<' ';
- C[ultim]=i;}
- prim++; }
- }
- int main()
- { fin>>n>>m>>x;
- int k, l, i;
- for(i=1; i<=m; i++)
- { fin>>k>>l;
- A[k][l]=A[l][k]=1;
- }
- BF(x);
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement