Cod sursa(job #1441038)
| Utilizator | Data | 23 mai 2015 15:04:50 | |
|---|---|---|---|
| Problema | Parcurgere DFS - componente conexe | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.6 kb |
#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
ifstream f("dfs.in");
ofstream g("dfs.out");
vector<int> graf[100000];
int nr=0, n, m, a, b, viz[100000];
void dfs(int vert)
{
viz[vert]=true;
for(int i:graf[vert])
{
if(!viz[i])
dfs(i);
}
}
int main()
{
f>>n>>m;
for(int i=0;i<m;i++)
{
f>>a>>b;
graf[a].push_back(b);
graf[b].push_back(a);
}
for(int i=1; i<=n; i++)
if(!vizitat[i])
{
nr++;
dfs(i);
}
g<<nr<<'\n';
return 0;
}
