Cod sursa(job #2666162)
Utilizator | Miruna Stefania Florescu florescu.miruna | Data | 1 noiembrie 2020 01:11:09 |
---|---|---|---|
Problema | Parcurgere DFS - componente conexe | Scor | 50 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.54 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f ("dfs.in");
ofstream g ("dfs.out");
int viz[100001], a[10001][10001],n,m,x,nod1,nod2,k;
void dfs(int x)
{
// g<<x<<" ";
viz[x]=1;
for(int i=1; i<=n; i++)
if(a[x][i]==1 && viz[i]==0)
dfs(i);
}
int main()
{
f>>n>>m;
for(int i=1;i<=m;i++)
{
f>>nod1>>nod2;
a[nod1][nod2]=a[nod2][nod1] = 1;
}
for(int i=1; i<=n; i++)
if(!viz[i])
dfs(i),k++;
g<<k;
return 0;
}