Cod sursa(job #1889095)
| Utilizator | Data | 22 februarie 2017 16:05:33 | |
|---|---|---|---|
| Problema | Parcurgere DFS - componente conexe | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.47 kb |
#include<bits/stdc++.h>
using namespace std;
int n,m,x,y,rs;
vector<int> V[100110];
bool u[100110];
void dfs(int x)
{
u[x]=1;
for(int i=0;i<V[x].size();i++)
if(!u[V[x][i]]) dfs(V[x][i]);
}
int main()
{
ifstream cin("dfs.in");
ofstream cout("dfs.out");
cin>>n>>m;
for(int i=1;i<=m;i++)
{
cin>>x>>y;
V[x].push_back(y);
V[y].push_back(x);
}
for(int i=1;i<=n;i++)
if(!u[i])
{
++rs;
dfs(i);
}
cout<<rs;
}
