Pagini recente » Cod sursa (job #328745) | Cod sursa (job #776430) | Cod sursa (job #2690003) | Cod sursa (job #1763265) | Cod sursa (job #773387)
Cod sursa(job #773387)
#include <iostream>
#include <vector>
#include <fstream>
using namespace std;
ifstream in("dfs.in");
ofstream out("dfs.out");
vector <int> a[1000005];
int b[1000005];
void dfs(int nod)
{
int i,t;
b[nod]=1;
t=a[nod].size();
for (i=0; i<t; i++)
if (b[a[nod][i]]==0) dfs(a[nod][i]);
}
int main()
{
int n,m,i,x,y,rez=0;;
in>>n>>m;
for (i=1; i<=m; i++)
{
in>>x>>y;
a[x].push_back(y);
a[y].push_back(x);
}
for (i=1; i<=n; i++)
if (b[i]==0)
{
rez++;
dfs(i);
}
out<<rez<<"\n";
in.close();
out.close();
return 0;
}