Cod sursa(job #2123902)
| Utilizator | Data | 6 februarie 2018 18:35:46 | |
|---|---|---|---|
| Problema | Parcurgere DFS - componente conexe | Scor | 10 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.51 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("dfs.in");
ofstream g("dfs.out");
int viz[1001],a[101][101],n,m,nr;
void citire()
{
f>>n>>m;
for(int i=1;i<=m;i++)
{
int x,y;
f>>x>>y;
a[x][y]=a[y][x]=1;
}
}
void df(int k)
{
viz[k]=nr;
for(int i=1;i<=n;i++)
{
if(!viz[i] && a[k][i])
df(i);
}
}
int main()
{citire();
for(int i=1;i<=n;i++)
{
if(!viz[i]) {nr++;df(i);}
}
g<<nr;
return 0;
}
