Cod sursa(job #1339547)
Utilizator | Data | 10 februarie 2015 23:07:36 | |
---|---|---|---|
Problema | Parcurgere DFS - componente conexe | Scor | 5 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.65 kb |
#include <iostream>
#include <fstream>
#include <stack>
using namespace std;
ifstream f("dfs.in");
ofstream g("dfs.out");
stack<int> s;
int mx[100][100],v[100],i,j,x1,x2,n,m,k,co=0;
void dfs(int x)
{
int i;
v[x]=1;
for (i = 1; i <= n; i++)
if (!v[i] && mx[x][i])
dfs(i);
}
int main()
{
f>>n>>m;
for(i=1; i<=n; i++)
for(j=1; j<=n; j++)
mx[i][j]=0;
for(i=1; i<=m; i++)
{
f>>x1>>x2;
mx[x1][x2]=mx[x2][x1]=1;
}
for(i=1; i<=n; i++)
if(v[i]!=1)
{
dfs(i);
co++;
}
g << co;
return 0;
}