Pagini recente » Cod sursa (job #1999787) | Cod sursa (job #1865139) | Cod sursa (job #1248351) | Cod sursa (job #1097588) | Cod sursa (job #2030556)
#include<fstream>
#include<vector>
using namespace std;
ifstream f("dfs.in");
ofstream g("dfs.out");
int nr, n, m;
bool viz[100001];
vector<int> l[200001];
void dfs(int nod)
{
viz[nod]=1;
for(int i=0;i<=l[nod].size();i++)
{
if(viz[l[nod][i]]==0)
dfs(l[nod][i]);
}
}
int main()
{
f>>n>>m;
for(int i=1;i<=m;i++)
{
int x, y;
f>>x>>y;
l[x].push_back(y);
l[y].push_back(x);
}
for(int i=1;i<=n;i++)
{
if(viz[i]==0)
{
dfs(i);
nr++;
}
}
g<<nr;
return 0;
}