Cod sursa(job #3203236)
| Utilizator | Data | 13 februarie 2024 12:52:04 | |
|---|---|---|---|
| Problema | Parcurgere DFS - componente conexe | Scor | 50 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.65 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("dfs.in");
ofstream fout("dfs.out");
int n,m;
int nr;
int mat[1005][1005];
bool viz[1005];
void citire()
{
fin>>n>>m;
int x,y;
for(int i=0;i<m;i++)
{
fin>>x>>y;
mat[x][y]=mat[y][x]=1;
}
}
void dfs(int nod)
{
viz[nod]=1;
for(int i=1;i<=n;i++)
{
if(mat[nod][i]==1 && !viz[i])
{
dfs(i);
}
}
}
int main()
{
citire();
for(int i=1;i<=n;i++)
{
if(!viz[i])
{
nr++;
dfs(i);
}
}
fout<<nr;
return 0;
}
