Cod sursa(job #2116353)
| Utilizator | Data | 27 ianuarie 2018 15:51:29 | |
|---|---|---|---|
| Problema | Parcurgere DFS - componente conexe | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.64 kb |
#include <iostream>
#include <fstream>
#include <vector>
#define NM 100010
using namespace std;
ifstream f("dfs.in");
ofstream g("dfs.out");
std::vector <int> v[NM];
int n,m,x,y,count;
int viz[NM];
void dfs(int nod)
{
viz[nod]=1;
for(int i=0;i<v[nod].size();i++)
{
if(!viz[v[nod][i]])
dfs(v[nod][i]);
}
}
int main ()
{
f>>n>>m;
for(int i=1;i<=m;i++)
{
f>>x>>y;
v[x].push_back(y);
v[y].push_back(x);
}
for(int i=1;i<=n;i++)
{
if(!viz[i])
{
dfs(i);
count++;
}
}
g<<count;
}
