Cod sursa(job #2634021)
| Utilizator | Data | 9 iulie 2020 16:36:58 | |
|---|---|---|---|
| Problema | BFS - Parcurgere in latime | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.5 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("dfs.in");
ofstream g("dfs.out");
vector <int > G[100001];
bool mark[100001];
int n,m;
void read()
{
f>>n>>m;
int i,a,b;
for(i=1;i<=m;i++)
{
f>>a>>b;
G[a].push_back(b);
G[b].push_back(a);
}
}
void DFS (int k)
{
mark[k]=1;
for(auto x: G[k])
if(!mark[x]) DFS(x);
}
int main()
{
int i,c=0;
read();
for(i=1;i<=n;i++)
{
if(!mark[i]) DFS(i),c++;
}
g<<c;
}
