Cod sursa(job #1808299)
Utilizator | Data | 17 noiembrie 2016 16:32:30 | |
---|---|---|---|
Problema | Parcurgere DFS - componente conexe | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.58 kb |
#include <fstream>
using namespace std;
ifstream fin ("dfs.in");
ofstream fout("dfs.out");
bool v[99999];
bool x[99999][99999];
int n;
void adancime(int r)
{
int i;
v[r]=1;
for(i=1;i<=n;i++)
if(x[r][i]==1&&v[i]==0)
adancime(i);
}
int main()
{
int m,i,j;
fin>>n>>m;
int w,q;
for(i=1;i<=m;i++)
{
fin>>q>>w;
x[q][w]=1;
x[w][q]=1;
}
int nrConex=0;
for(i=1;i<=n;i++)
if(v[i]==0)
{
nrConex++;
adancime(i);
}
fout<<nrConex;
}