Pagini recente » Cod sursa (job #1885469) | Cod sursa (job #1764664) | Cod sursa (job #1010714) | Cod sursa (job #1586951) | Cod sursa (job #1243631)
#include <fstream>
#include <vector>
#define nmax 100001
using namespace std;
ifstream f("dfs.in");
ofstream g("dfs.out");
vector <int> v[nmax];
int n,m,a,b,used[nmax];
void dfs(int k)
{
used[k]=1;
for(vector <int> :: iterator it=v[k].begin();it!=v[k].end();++it)
{
if(!used[*it])
dfs(*it);
}
}
int main()
{
int count=0;
f>>n>>m;
for(int i=1;i<=m;i++)
{
f>>a>>b;
v[a].push_back(b);
v[b].push_back(a);
}
for(int i=1;i<=n;i++)
{
if(!used[i])
{
count++;
dfs(i);
}
}
g<<count;
return 0;
}