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