Pagini recente » Cod sursa (job #2969841) | Cod sursa (job #2105370) | Cod sursa (job #894632) | Cod sursa (job #2414738) | Cod sursa (job #1430918)
#include<fstream>
#include<vector>
using namespace std;
ifstream f("dfs.in");
ofstream g("dfs.out");
vector<int> a[100002];
bool viz[100002];
int n,m,cc=0;
void dfs(int nod)
{
if(!viz[nod])
{
viz[nod]=1;
int l=a[nod].size();
for(int i=0;i<l;i++)
dfs(a[nod][i]);
}
return;
}
int main()
{
f>>n>>m;
for(int i=0;i<m;i++)
{
int x,y;
f>>x>>y;
a[x].push_back(y);
a[y].push_back(x);
}
for(int i=1;i<=n;i++)
{
if(!viz[i])
{
cc++;
dfs(i);
}
}
g<<cc;
f.close();g.close();
return 0;
}