Cod sursa(job #905753)
Utilizator | Data | 6 martie 2013 09:26:46 | |
---|---|---|---|
Problema | Parcurgere DFS - componente conexe | Scor | 55 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.68 kb |
#include <fstream>
#include <vector>
using namespace std;
ifstream in("dfs.in");
ofstream out("dfs.out");
bool b[100001];
vector <int> a[100001];
int z, p, i, m, n, nr;
void dfs(int y)
{
int j,x;
for(j=0;j<a[y].size();j++)
{
x=a[y][j];
if(b[x]==false)
{
b[x]=true;
dfs(x);
}
}
}
int main()
{
in>>n>>m;
for(i=1;i<n;i++)
{
in>>z>>p;
a[z].push_back(p);
a[p].push_back(z);
}
for(i=1;i<=n;i++)
{
if(b[i]==false)
{
nr++;
b[i]=true;
dfs(i);
}
}
out<<nr;
return 0;
}