Pagini recente » Cod sursa (job #412604) | Cod sursa (job #323892) | Monitorul de evaluare | Borderou de evaluare (job #1588377) | Cod sursa (job #3352301)
#include <fstream>
#include <vector>
using namespace std;
ifstream cin("dfs.in");
ofstream cout("dfs.out");
const int N = 200000;
int vizit[N + 1];
vector <int> v[N + 1];
int n, cnx = 0;
long long m;
void citire_graf(int n, long long m)
{
int i, x, y;
for(i = 0; i < m; i++)
{
cin >> x >> y;
v[x].push_back(y);
v[y].push_back(x);
}
}
void dfs(int nod)
{
vizit[nod] = 1;
//printf("%d ", n);
for(int i = 0; i < v[nod].size(); i++)
{
if(vizit[v[nod][i]] == 0)
{
//printf("%d ", v[nod][i]);
dfs(v[nod][i]);
}
}
}
int main()
{
cin >> n >> m;
citire_graf(n, m);
for(int i = 1; i <= n; i++)
{
if(vizit[i] == 0)
{
cnx++;
dfs(i);
}
}
cout << cnx;
return 0;
}