Cod sursa(job #3272369)
| Utilizator | Data | 29 ianuarie 2025 11:12:25 | |
|---|---|---|---|
| Problema | Parcurgere DFS - componente conexe | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.67 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream in("dfs.in");
ofstream out("dfs.out");
int a[10001][100001],nrc=0,viz[100001],n,x,y;
void df(int x)
{
viz[x]=nrc;
for(int i=1; i<=n; i++)
if(a[x][i]==1 && viz[i]==0)
df(i);
}
int main()
{
in>>n;
while(in>>x>>y)
{
a[x][y]=a[y][x]=1;
}
for(int i=1; i<=n; i++)
{
if(viz[i]==0)
{
nrc++;
df(i);
}
}
out<<nrc<<'\n';
for(int i=1; i<=n; i++)
{
for(int j=1; j<=n; j++)
if(viz[j]==i)
out<<j<<' ';
out<<'\n';
}
return 0;
}
