Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <bits/stdc++.h>
- using namespace std;
- ifstream f("BFS.in");
- ofstream g("BFS.out");
- int n,m,q[101],viz[101],a[101][101],T,u,p;
- void citire()
- {
- f>>n>>m>>T;
- for(int i=1; i<=m; i++)
- {
- int x,y;
- f>>x>>y;
- a[x][y]=a[y][x]=1;
- }
- }
- void BfS(int start)
- {
- q[1]=start;
- viz[start]=1;
- p=u=1;
- while(p<=u)
- {
- int x=q[p];
- p++;
- for(int i=1; i<=n; i++)
- if(a[x][i]==1 && viz[i]==0)
- {
- q[++u]=i;
- viz[i]=1;
- }
- }
- for(int i=1; i<=u; i++)
- g<<q[i]<<" ";
- }
- int main()
- {
- citire();
- BfS(T);
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement