Pagini recente » Cod sursa (job #1280116) | Cod sursa (job #755993) | Cod sursa (job #1549449) | Rating Matei Aldea (Popicaru13) | Cod sursa (job #1706708)
#include <fstream>
#include <vector>
using namespace std;
ifstream f("dfs.in");
ofstream g("dfs.out");
const int NMAX=100005;
int n,m,x,y,ans;
bool viz[NMAX];
vector <int> a[NMAX];
inline void Dfs(int nod)
{
viz[nod]=1;
for(int i=0;i<a[nod].size();i++)
if(!viz[a[nod][i]])
Dfs(a[nod][i]);
}
int main()
{
f>>n>>m;
for(int i=1;i<=m;i++)
{
f>>x>>y;
a[x].push_back(y);
a[y].push_back(x);
}
for(int i=1;i<=n;i++)
{
if(!viz[i])
{
ans++;
Dfs(i);
}
}
g<<ans<<"\n";
return 0;
}