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,a[101][101],c[101],st,dr,v[101],x;
- void citire()
- { int i,j;
- fin>>n>>m>>x;
- for(int p=1;p<=m;p++)
- {
- fin>>i>>j;
- a[i][j]=a[j][i]=1;
- }
- }
- void bfs(int nod)
- {
- v[nod]=1;
- fout<<nod<<' ';
- st=dr=1;
- c[dr]=nod;
- while(st<=dr)
- {
- nod=c[st];
- for(int i=1;i<=n;i++)
- if(a[nod][i]==1 && !v[i])
- {
- v[i]=1;
- fout<<i<<' ';
- c[++dr]=i;
- }
- st++;
- }
- }
- int main()
- {
- citire();
- bfs(x);
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement