Mai intai trebuie sa te autentifici.
Cod sursa(job #2577662)
| Utilizator | Data | 9 martie 2020 18:15:09 | |
|---|---|---|---|
| Problema | Parcurgere DFS - componente conexe | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.54 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("bfs.in");
ofstream g("bfs.out");
int x,y,n,m,nrc;
vector<int>v[100001];
bool viz[100001];
void dfs(int k)
{
viz[k]=1;
for(int i=0;i<v[k].size();++i)
if(!viz[v[k][i]])
dfs(v[k][i]);
}
int main()
{
f>>n>>m;
for(int i=1;i<=m;++i)
{
f>>x>>y;
v[x].push_back(y);
v[y].push_back(x);
}
for(int i=1;i<=n;++i)
if(!viz[i])
{
nrc++;
dfs(i);
}
g<<nrc;
return 0;
}
