Cod sursa(job #2850785)
| Utilizator | Data | 17 februarie 2022 15:56:33 | |
|---|---|---|---|
| Problema | Parcurgere DFS - componente conexe | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.63 kb |
#include <fstream>
#include <vector>
using namespace std;
ifstream f("dfs.in");
ofstream g("dfs.out");
const int N=1e5 + 1;
vector <int> a[N];
bool v[N];
int n,m,cnt;
void dfs(int nod)
{
v[nod]=1;
for(auto y:a[nod])
{
if(!v[y])
{
dfs(y);
}
}
}
int main()
{
int i;
f>>n>>m;
for(i=1;i<=m;i++)
{
int x,y;
f>>x>>y;
a[x].push_back(y);
a[y].push_back(x);
}
for(i=1;i<=n;i++)
{
if(!v[i])
{
cnt++;
dfs(i);
}
}
g<<cnt;
return 0;
}