Cod sursa(job #2371028)
Utilizator | Data | 6 martie 2019 15:13:00 | |
---|---|---|---|
Problema | Parcurgere DFS - componente conexe | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.55 kb |
#include<bits/stdc++.h>
using namespace std;
ifstream f("dfs.in");
ofstream g("dfs.out");
int n,m,s,x,y,nrc,v[100001],i;
vector <int>G[100001];
void dfs(int nod)
{
v[nod]=nrc;
for(int i=0;i<G[nod].size();i++)
{
if(v[G[nod][i]]==0)
dfs(G[nod][i]);
}
}
int main()
{
f>>n>>m;
for(i=1;i<=m;i++)
{
f>>x>>y;
G[x].push_back(y);
G[y].push_back(x);
}
for(i=1;i<=n;i++)
{
if(v[i]==0)
{
nrc++;
dfs(i);
}
}
g<<nrc;
return 0;
}