Cod sursa(job #2377894)
Utilizator | Catalin Breaz FMI catalin.brz98 | Data | 11 martie 2019 13:37:54 |
---|---|---|---|
Problema | Parcurgere DFS - componente conexe | Scor | 95 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.69 kb |
#include<iostream>
#include<fstream>
#include<vector>
using namespace std;
int s[100005];
vector<int>a[100000];
void DF(int x)
{
int vecin;
s[x]=1;
int k, lim=a[x].size();
for(k=0;k<lim;k++)
{
vecin=a[x][k];
if(!s[vecin])
DF(vecin);
}
}
int main()
{
int i, j, x, m, y, g=0, n;
ifstream f("dfs.in");
ofstream l("dfs.out");
f>>n;
f>>m;
for(i=1;i<=m;i++)
{
f>>x>>y;
a[x].push_back(y);
a[y].push_back(x);
}
for(i=1;i<=n;i++)
if(s[i]==0)
{
g++;
DF(i);
}
l<<g;
f.close();
l.close();
return 0;
}