Mai intai trebuie sa te autentifici.
Cod sursa(job #1773927)
Utilizator | Data | 8 octombrie 2016 13:04:58 | |
---|---|---|---|
Problema | Parcurgere DFS - componente conexe | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.56 kb |
#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
ifstream f("dfs.in");
ofstream g("dfs.out");
vector <int> G[100005];
int n, m, x, y, i, j, nrc;
bool viz[100005];
void dfs(int nod)
{
viz[nod]=1;
for(auto it:G[nod])
if(!viz[it])
dfs(it);
}
int main()
{ f>>n>>m;
for(i=1;i<=m;i++)
{ f>>x>>y;
G[x].push_back(y);
G[y].push_back(x);
}
for(i=1;i<=n;i++)
if(!viz[i])
{ nrc++;
dfs(i);
}
g<<nrc;
return 0;
}