Cod sursa(job #2269620)
| Utilizator | Data | 26 octombrie 2018 11:40:31 | |
|---|---|---|---|
| Problema | Parcurgere DFS - componente conexe | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.6 kb |
#include <fstream>
#include <vector>
using namespace std;
ifstream f("dfs.in");
ofstream g("dfs.out");
vector <int> a[100100];
int viz[100100];
void dfs(int nod)
{
int i;
viz[nod]=1;
for(i=0;i<a[nod].size();i++)
if(viz[a[nod][i]]==0){dfs(a[nod][i]);}
}
int n,m,i,y,nr,x;
int main()
{
f>>n>>m;
for(i=1;i<=m;i++)
{
f>>x>>y;
a[x].push_back(y);
a[y].push_back(x);
}
for(i=1;i<=n;i++)
{
if(viz[i]==0)
{
dfs(i);
nr++;
}
}
g<<nr;
return 0;
}
