Cod sursa(job #2889263)
| Utilizator | Data | 12 aprilie 2022 15:29:47 | |
|---|---|---|---|
| Problema | Parcurgere DFS - componente conexe | Scor | 50 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.46 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("dfs.in");
ofstream g("dfs.out");
int m,n,a[1001][1001],viz[1001];
void DFS(int x)
{
viz[x]=1;
for(int i=1; i<=n; i++)
if(a[x][i]==1 && viz[i]==0)
DFS(i);
}
int main()
{
int x,y,nrc=0;
f>>n>>m;
for(int i=1; i<=m; i++)
{
f>>x>>y;
a[x][y]=1;
a[y][x]=1;
}
DFS(1);
nrc++;
for(int i=1; i<=n; i++)
{
if(viz[i]==0)
{
DFS(i);
nrc++;
}
}
g<<nrc<<endl;
f.close();
g.close();
}