Cod sursa(job #2538384)
Utilizator | Data | 4 februarie 2020 18:21:21 | |
---|---|---|---|
Problema | Parcurgere DFS - componente conexe | Scor | 45 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.57 kb |
#include <fstream>
#include <vector>
using namespace std;
ifstream f("dfs.in");
ofstream g("dfs.out");
vector <int> G[1000];
bool sel[1000];
int n,m,x,y,nr;
void dfs(int x)
{
sel[x]=true;
//g<<x<<' ';
for(auto i:G[x])
if(!sel[i])
dfs(i);
}
int main()
{
f>>n>>m;
for(int i=1 ; i<=m ; i++)
{
f>>x>>y;
G[x].push_back(y);
G[y].push_back(x);
}
for(int i=1 ; i<=n ; i++)
if(!sel[i])
{
dfs(i);
nr++;
}
g<<nr;
return 0;
}