Cod sursa(job #2371663)
| Utilizator | Data | 6 martie 2019 18:55:03 | |
|---|---|---|---|
| Problema | Parcurgere DFS - componente conexe | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.51 kb |
#include<fstream>
#include<vector>
using namespace std;
ifstream f ("dfs.in");
ofstream g ("dfs.out");
vector <int>G[100100];
int n,x,y,nr,m,viz[100100];
void dfs(int x){
viz[x]=1;
for(int i=0;i<G[x].size();++i){
if(!viz[G[x][i]]) dfs(G[x][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(!viz[i])++nr,dfs(i);
}
g<<nr;
return 0;
}
