Pagini recente » Cod sursa (job #166909) | Cod sursa (job #3347422) | Cod sursa (job #1369352) | Cod sursa (job #2535445) | Cod sursa (job #3350899)
#include <fstream>
#include <vector>
using namespace std;
ifstream cin ("dfs.in");
ofstream cout ("dfs.out");
vector<int> g[100001];
int viz[100001];
void dfs(int x)
{
viz[x] = 1;
for (int i = 0; i < g[x].size(); i++)
{
if (viz[g[x][i]] == 0)
{
dfs(g[x][i]);
}
}
}
int main()
{
int n,m;
cin >>n>>m;
for (int i = 1; i <= m; i++)
{
int x,y;
cin >>x>>y;
g[x].push_back(y);
g[y].push_back(x);
}
int cnt = 0;
for (int i = 1; i <= n; i++)
{
if (viz[i] == 0)
{
dfs(i);
cnt++;
}
}
cout <<cnt;
return 0;
}