Cod sursa(job #1317155)
| Utilizator | Data | 14 ianuarie 2015 17:12:04 | |
|---|---|---|---|
| Problema | Parcurgere DFS - componente conexe | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.64 kb |
#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
ifstream fin("dfs.in");
ofstream fout("dfs.out");
#define MAX 100010
vector <int> v[MAX];
bool viz[MAX];
void dfs(int j)
{
viz[j]=1;
for(int i=0;i<v[j].size();i++)
if(!viz[v[j][i]])
dfs(v[j][i]);
}
int main()
{
int n,m,a,b;
fin>>n>>m;
for(int i=1;i<=m;i++)
{
fin>>a>>b;
v[a].push_back(b);
v[b].push_back(a);
}
int s=0;
for(int i=1;i<=n;i++)
if(!viz[i])
{
s++;
dfs(i);
}
fout<<s;
return 0;
}
