Cod sursa(job #2533566)
| Utilizator | Data | 29 ianuarie 2020 12:22:57 | |
|---|---|---|---|
| Problema | Parcurgere DFS - componente conexe | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.64 kb |
#include <fstream>
#include <vector>
using namespace std;
ifstream fi("dfs.in");
ofstream fo("dfs.out");
const int nmax=1e5;
int n, m, cnt;
int viz[nmax+5];
vector <int> G[nmax+5];
void dfs(int nod)
{
viz[nod]=1;
for(auto vec:G[nod])
if(!viz[vec])
dfs(vec);
}
int main()
{
fi>>n>>m;
for(int i=1; i<=m; i++)
{
int x, y;
fi>>x>>y;
G[x].push_back(y);
G[y].push_back(x);
}
for(int i=1; i<=n; i++)
if(!viz[i])
{
cnt++;
dfs(i);
}
fo<<cnt;
fi.close();
fo.close();
return 0;
}
