Mai intai trebuie sa te autentifici.
Cod sursa(job #2553704)
| Utilizator | Data | 22 februarie 2020 11:15:03 | |
|---|---|---|---|
| Problema | Parcurgere DFS - componente conexe | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.61 kb |
#include <iostream>
#include <vector>
#include <fstream>
using namespace std;
ifstream f("dfs.in");
ofstream g("dfs.out");
int viz[100001];
vector <int> v[100001];
void dfs(int nod)
{
int i;
viz[nod]=1;
for(i=0;i<v[nod].size();i++)
if(viz[v[nod][i]]==0)
dfs(v[nod][i]);
}
int main()
{
int N, M, i, x, y, nrc=0;
f >> N >> M;
for(i=0;i<M;i++)
{
f >> x >> y;
v[x].push_back(y);
v[y].push_back(x);
}
for(i=1;i<=N;i++)
{
if(viz[i]==0)
{
nrc++;
dfs(i);
}
}
g << nrc;
return 0;
}
