Cod sursa(job #3151561)
| Utilizator | Data | 21 septembrie 2023 20:01:51 | |
|---|---|---|---|
| Problema | Parcurgere DFS - componente conexe | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.67 kb |
#include <fstream>
#include <vector>
using namespace std;
ifstream cin("dfs.in");
ofstream cout("dfs.out");
vector<int> v[100001];
int viz[100001];
int m, n;
void dfs(int x)
{
for(int i : v[x])
{
if(viz[i] == 0)
{
viz[i] = 1;
dfs(i);
}
}
}
int main()
{
cin >> n >> m;
for(int i = 0; i<m; i++)
{
int a, b;
cin >> a >> b;
v[a].push_back(b);
v[b].push_back(a);
}
int k = 0;
for(int i = 1; i<=n; i++)
if(viz[i] == 0)
{
viz[i] = 1;
dfs(i);
k++;
}
cout << k;
}
