Cod sursa(job #2029803)
Utilizator | Data | 30 septembrie 2017 14:25:27 | |
---|---|---|---|
Problema | Parcurgere DFS - componente conexe | Scor | 45 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.59 kb |
#include <fstream>
#include <vector>
using namespace std;
ifstream fin ("dfs.in");
ofstream fout ("dfs.out");
int n,m,p,x,y,i,ok,nr,v[100001],c[100001];
vector <int> L[100001];
void dfs(int nod){
v[nod]=1;
for(int i=0;i<L[nod].size();i++){
int nodv=L[nod][i];
if(v[nodv]==0)
dfs(nodv);
}
}
int main(){
fin>>n>>m>>p;
for(i=1;i<=m;i++){
fin>>x>>y;
L[x].push_back(y);
L[y].push_back(x);
}
for(i=1;i<=n;i++)
if(v[i]==0){
++nr;
dfs(i);
}
fout<<nr;
}