Cod sursa(job #1781692)
| Utilizator | Data | 17 octombrie 2016 11:25:11 | |
|---|---|---|---|
| Problema | Parcurgere DFS - componente conexe | Scor | 15 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.7 kb |
#include <fstream>
#include <vector>
using namespace std;
ifstream fin ("dfs.in");
ofstream fout("dfs.out");
bool viz[100001];
int n, m;
vector <int>l[100001];
void df(int nod)
{
viz[nod]=1;
for(int i=0;i<l[nod].size();i++)
if(viz[l[nod][i]]==0)
{
viz[l[nod][i]]=1;
df(i);
}
}
void inser()
{
int x, y, nr=0;
fin>>n>>m;
for(int i=1;i<=m;i++)
{
fin>>x>>y;
l[x].push_back(y);
l[y].push_back(x);
}
for(int i=1;i<=n;i++)
if(viz[i]==0)
{
nr++;
df(i);
}
fout<<nr;
}
int main()
{
inser();
return 0;
}
