Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <fstream>
- using namespace std;
- int a[100][100];
- int viz[100];
- int n;
- int k;
- void citire()
- {
- ifstream f("listavecini.in");
- int c=0;
- f>>n;
- int x,y;
- while(!f.eof())
- {
- f>>x;
- f>>y;
- a[x][y]=1;
- c++;
- }
- f.close();
- }
- void afisare()
- {
- ofstream g("listavecini.out");
- for(int i=1; i<=n; i++)
- {
- for(int j=0; j<=a[i][0]; j++)
- g<<a[i][j]<<" ";
- g<<endl;
- }
- g.close();
- }
- void dfs(int &k, int nod)
- {
- viz[nod]=k;
- for(int i=0;i<=n;i++)
- if(viz[i]==0 && a[nod][i]==1)
- dfs(i,k);
- }
- int main()
- {
- citire();
- dfs();
- afisare();
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement