Cod sursa(job #1779323)
Utilizator | Data | 15 octombrie 2016 08:04:09 | |
---|---|---|---|
Problema | Parcurgere DFS - componente conexe | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include<iostream>
#include<cmath>
using namespace std;
int viz[20],comp[20],i,nr_comp;
void dfs(int nod,int nr)
{
viz[nod]=1;
comp[nod]=nr;
for(auto it:G[nod])
{
if(!viz[it])
{
dfs(it,nr);
}
}
}
int main()
{
int i,n;
for(i=1;i<=n;i++)
{
if(!viz[i])
{
++nr_comp;
dfs(i,nr_comp);
}
}
}