Cod sursa(job #1997062)
Utilizator | Aelenei Roxana roxana.aelenei | Data | 3 iulie 2017 12:08:47 |
---|---|---|---|
Problema | Parcurgere DFS - componente conexe | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.62 kb |
#include <fstream>
#include <vector>
using namespace std;
ifstream in("dfs.in");
ofstream out("dfs.out");
vector <int> G[100005];
int viz[100005],cnt;
void dfs (int nod)
{
viz[nod]=cnt;
int l=G[nod].size();
for(int i=0; i<l; i++)
{
int x=G[nod][i];
if(!viz[x])
dfs(x);
}
}
int main()
{
int n,m,x,y;
in>>n>>m;
for(int i=1; i<=m; i++)
{
in>>x>>y;
G[x].push_back(y);
G[y].push_back(x);
}
for(int i=1; i<=n; i++)
if(viz[i]==0)
{
cnt++;
dfs(i);
}
out<<cnt;
return 0;
}