Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- using namespace std;
- int i,j,k,n,m,viz[1001];
- int nr=0;
- long long A[1001][1001], B[1001][10001];
- void bf(int nod){
- int k;
- viz[nod]=1;
- cout<<nod<<" ";
- for(i=1;i<=n;i++){
- if(A[nod][i]==1 && viz[i]==0)
- bf(i);
- }
- }
- int main()
- {
- cin>>n>>m;
- for(k=1;k<=m;k++){
- cin>>i>>j;
- A[i][j]=1;
- B[j][i]=1;
- }
- for(i=1;i<=n;i++){
- if(viz[i]==0){
- bf(i);
- }
- cout<<endl;
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement