Pagini recente » Cod sursa (job #2549844) | Cod sursa (job #159899) | Cod sursa (job #2282398) | Cod sursa (job #2835901) | Cod sursa (job #1108249)
#include<fstream>
#include<vector>
using namespace std;
ifstream in("dfs.in");
ofstream out("dfs.out");
const int nmax = 100002;
vector <int> g[nmax];
int n, m, x, y, rasp;
bool poz[nmax];
void dfs(int a){
poz[a] = 1;
for(int i = 0; i<(int)g[a].size(); i++)
{
if(poz[g[a][i]]==0)
dfs(g[a][i]);
}
}
int main()
{
in>>n>>m;
for(int i = 0; i<m; i++)
{
in>>x>>y;
g[x].push_back(y);
g[y].push_back(x);
}
for(int i = 1; i<=n; i++)
{
if(poz[i]==0)
{
dfs(i);
rasp++;
}
}
out<<rasp<<'\n';
return 0;
}