Cod sursa(job #820966)
Utilizator | Data | 21 noiembrie 2012 14:46:03 | |
---|---|---|---|
Problema | Parcurgere DFS - componente conexe | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.56 kb |
#include<iostream>
#include<fstream>
#include<stdio.h>
using namespace std;
ifstream f("dfs.in");
ofstream g("dfs.out");
int n,m,i,j,a[100][100],x,y,viz[100],k;
void DFS(int nod)
{
int i;
viz[nod] = 1;
for (i = 1; i <= n; i++)
if (!viz[i] && a[nod][i])
DFS(i);
}
int main()
{
f>>n>>m;
for(j=1;j<=m;j++)
{
f>>x>>y;
a[x][y]=1;
}
for (i = 1; i <= n; i++)
if (!viz[i])
{
k++;
DFS(i);
}
g<<k;
return 0;
}