Cod sursa(job #2916673)
Utilizator | Data | 31 iulie 2022 12:42:18 | |
---|---|---|---|
Problema | Parcurgere DFS - componente conexe | Scor | 50 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.64 kb |
#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
ifstream f("dfs.in");
ofstream g("dfs.out");
int n,m,i,l,c,nr,viz[1001];
vector <int>a[1001];
void df(int i)
{
viz[i]=nr;
int j;
for(j=0;j<a[i].size();j++)
{
if(viz[a[i][j]]==0)
{
df(a[i][j]);
}
}
}
int main()
{
f>>n>>m;
for(i=1;i<=m;i++)
{
f>>l>>c;
a[l].push_back(c);
a[c].push_back(l);
}
for(i=1;i<=n;i++)
{
if(viz[i]==0)
{
nr++;
df(i);
}
}
g<<nr;
return 0;
}