Cod sursa(job #2293876)
Utilizator | Axinte Teodor TeodorAxinte | Data | 1 decembrie 2018 17:51:19 |
---|---|---|---|
Problema | Parcurgere DFS - componente conexe | Scor | 50 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.5 kb |
#include <fstream>
using namespace std;
ifstream fin("dfs.in");
ofstream fout("dfs.out");
int a[1010][1010],v[1010],n,m,x,y,ct;
void DFS(int);
int main()
{
fin>>n>>m;
for(;m;m--)
{
fin>>x>>y;
a[x][y]=a[y][x]=1;
}
for(int i=1;i<=n;i++)
if(!v[i])
{
ct++;
DFS(i);
}
fout<<ct;
return 0;
}
void DFS(int start)
{
v[start]=ct;
for(int i=1;i<=n;i++)
if(!v[i] && a[start][i])
DFS(i);
}