Cod sursa(job #2370385)
Utilizator | Data | 6 martie 2019 11:54:14 | |
---|---|---|---|
Problema | Parcurgere DFS - componente conexe | Scor | 55 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.52 kb |
#include <bits/stdc++.h>
#define N 100001
using namespace std;
ifstream fin("dfs.in");
ofstream fout("dfs.out");
int t[N],n,m,nr;
int main()
{
int i,a,b,j;
fin>>n>>m;
for(i=1;i<=n;i++)
t[i]=i;
nr=n;
for(i=1;i<=m;i++)
{
fin>>a>>b;
if(t[a]!=t[b])
{
nr--;
int val=t[b];
for(j=1;j<=n;j++)
if(t[j]==val)
t[j]=t[a];
}
}
fout<<nr;
return 0;
}