Pagini recente » Cod sursa (job #148330) | Cod sursa (job #2054151) | Cod sursa (job #1859825) | Cod sursa (job #678360) | Cod sursa (job #1074974)
#include <fstream>
#include <vector>
using namespace std;
int n, m, i, a, b, comp;
bool viz[100001];
vector<int> graf[100001];
void dfs(int k)
{
int t;
viz[k]=1;
for(t=0; t<graf[k].size(); t++)
{
if(!viz[graf[k][t]])
dfs(graf[k][t]);
}
}
int main()
{
ifstream f("dfs.in");
ofstream g("dfs.out");
f>>n>>m;
for(i=1; i<=m; i++)
{
f>>a>>b;
graf[a].push_back(b);
graf[b].push_back(a);
}
for(i=1; i<=n; i++)
{
if(!viz[i])
{
comp++;
dfs(i);
}
}
g<<comp;
}