Cod sursa(job #1434458)
| Utilizator | Data | 10 mai 2015 17:36:45 | |
|---|---|---|---|
| Problema | Parcurgere DFS - componente conexe | Scor | 50 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.48 kb |
#include<iostream>
#include<fstream>
using namespace std;
int N,M, a[1001][1001],viz[1001],nrc;
void dfs(int nod)
{
viz[nod]=1;
for(int i=1; i<=N; i++)
if(viz[i]!=1 && a[nod][i]!=0)
dfs(i);
}
int main()
{
int i,x,y;
ifstream f("dfs.in");
f>>N>>M;
for(i=1; i<=M; i++)
{
f>>x>>y;
a[x][y]=1;
a[y][x]=1;
}
f.close();
for(i=1; i<=N; i++)
if(!viz[i])
{
nrc++;
dfs(i);
}
ofstream g("dfs.out");
g<<nrc;
g.close();
return 0;
}