Cod sursa(job #2174922)
| Utilizator | Data | 16 martie 2018 14:15:16 | |
|---|---|---|---|
| Problema | Parcurgere DFS - componente conexe | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.63 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("dfs.in");
ofstream g("dfs.out");
int n,m,viz[100001],nrc;
vector <int> v[100001];
void df(int x)
{
viz[x]=nrc;
for(int j=0; j<v[x].size(); j++)
{
int vecin=v[x][j];
if(!viz[vecin])
df(vecin);
}
}
void citire()
{
f>>n>>m;
for(int i=1; i<=m; i++)
{
int x,y;
f>>x>>y;
v[x].push_back(y);
v[y].push_back(x);
}
}
int main()
{
citire();
for(int i=1; i<=n; ++i)
if(!viz[i])
{
nrc++;
df(i);
}
g<<nrc;
}
