Cod sursa(job #2129833)
Utilizator | Samoila Andrei andreisamoila74 | Data | 13 februarie 2018 10:11:02 |
---|---|---|---|
Problema | Parcurgere DFS - componente conexe | Scor | 50 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.51 kb |
#include <fstream>
using namespace std;
ifstream f("dfs.in");
ofstream g("dfs.out");
int n,m,x,y,a[1001][1001],i,j,v[1001],k;
void citire()
{
f>>n>>m;
for (int i=1;i<=m;i++)
{
f>>x>>y;
a[x][y]=a[y][x]=1;
}
}
void dfs(int k)
{
v[k]=1;
for (int i=1;i<=n;i++)
if (v[i]==0 && a[k][i]==1)
{
dfs(i);
}
}
int main()
{
citire();
for (i=1;i<=n;i++)
if (v[i]==0)
{
k++;
dfs(i);
}
g<<k;
}