Pagini recente » Cod sursa (job #1851377) | Cod sursa (job #214627) | Cod sursa (job #285340) | Cod sursa (job #2537584) | Cod sursa (job #1488206)
#include<fstream>
#include<vector>
using namespace std;
ifstream in("dfs.in");
ofstream out("dfs.out");
int n, m2, i, x, y, nr;
bool m[100003];
vector <int> L[100003];
void dfs(int nod){
for(int i=0; i<L[nod].size(); i++){
int fiu=L[nod][i];
if(m[fiu]==false){
m[fiu]=true;
dfs(fiu);
}
}
}
int main()
{
in>>n>>m2;
for(i=1; i<=m2; i++)
{
in>>x>>y;
L[x].push_back(y);
L[y].push_back(x);
}
dfs(1);
m[1]=true;
for(i=2; i<=n; i++)
if(m[i]==false)
{
dfs(i);
nr++;
}
out<<nr+1;
return 0;
}