Cod sursa(job #2693540)
| Utilizator | Data | 6 ianuarie 2021 12:49:22 | |
|---|---|---|---|
| Problema | Parcurgere DFS - componente conexe | Scor | 30 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.61 kb |
#include <iostream>
#include <fstream>
using namespace std;
int a[10000][10000],n,m,viz[200005]={0};
void citire()
{
ifstream f("dfs.in");
f>>n>>m;
int k,x,y;
for(k=1;k<=n;k++)
{
f>>x>>y;
a[x][y]=a[y][x]=1;
}
}
void DFS(int v)
{
int i;
viz[v]=1;
for(i=1;i<=n;i++)
if(a[v][i]&&!viz[i])
{
DFS(i);
}
}
int main()
{
int c=0;
citire();
for(int i=1;i<=n;i++)
if(!viz[i])
{
DFS(i);
c++;
}
ofstream g("dfs.out");
g<<c;
return 0;
}
