Pagini recente » Cod sursa (job #2358013) | Cod sursa (job #1455651) | Cod sursa (job #1197815) | Cod sursa (job #991473) | Cod sursa (job #2965901)
#include <fstream>
#include <vector>
using namespace std;
ifstream fin("dfs.in");
ofstream fout("dfs.out");
int n,m;
vector <int> v[100005];
bool f[100005];
int sol;
void dfs(int nod)
{
f[nod]=true;
for(int i=0;i<v[nod].size();i++)
{
if(!f[v[nod][i]])
{
dfs(v[nod][i]);
}
}
}
int main()
{
fin>>n>>m;
for(int i=1;i<=m;i++)
{
int x,y;
fin>>x>>y;
v[x].push_back(y);
v[y].push_back(x);
}
for(int i=1;i<=n;i++)
{
if(!f[i])
{
dfs(i);
sol++;
}
}
fout<<sol;
}