Cod sursa(job #2928944)
Utilizator | Sabaceag Marius k20y | Data | 24 octombrie 2022 12:07:25 |
---|---|---|---|
Problema | Parcurgere DFS - componente conexe | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.63 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream in("dfs.in");
ofstream out("dfs.out");
const int N= 1e5+5;
int n;
vector<int> v[N];
bool parcurs[N];
void dfs(int nod)
{
if(parcurs[nod]) return;
parcurs[nod]=1;
for(int i=0;i<v[nod].size();i++)
dfs(v[nod][i]);
}
int main()
{
int m; in>>n>>m;
for(int i=1; i<=m; i++)
{
int x,y; in>>x>>y;
v[x].push_back(y);
v[y].push_back(x);
}
int nrCC=0;
for(int i=1; i<=n; i++)
if(!parcurs[i])
{
nrCC++;
dfs(i);
}
out<<nrCC;
}