Cod sursa(job #3248591)
| Utilizator | Data | 12 octombrie 2024 10:51:52 | |
|---|---|---|---|
| Problema | Parcurgere DFS - componente conexe | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.59 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("date.in");
ofstream fout("date.out");
vector<int>a[1001];
int vizited[1001];
int c;
void dfs(int nod)
{
vizited[nod]=1;
for(auto i:a[nod])
{
if(!vizited[i])
dfs(i);
}
}
int main()
{
int n,i,x,y,m;
fin>>n>>m;
for(i=1;i<=m;i++)
{
fin>>x>>y;
a[x].push_back(y);
a[y].push_back(x);
}
for(i=1;i<=n;i++)
{
if(!vizited[i])
{
dfs(i);
c++;
}
}
fout<<c;
return 0;
}
