Pagini recente » Istoria paginii runda/testround10/clasament | Rating Lepadatu Vlad-Tudor (TheSHAD0W) | Cod sursa (job #794612) | Istoria paginii utilizator/agrohimzxo | Cod sursa (job #2266969)
#include <fstream>
#include <vector>
using namespace std;
ifstream fin("dfs.in");
ofstream fout("dfs.out");
int n,m,conexe=0;
const int nlim=100005;
vector<int> adiacenta[nlim];
bool use[nlim];
void citire() {
fin>>n>>m;
for(int i=0;i<m;i++) {
int x,y;
fin>>x>>y;
adiacenta[x].push_back(y);
adiacenta[y].push_back(x);
}
}
void dfs(int nod) {
use[nod]=1;
for(unsigned int i=0;i<adiacenta[nod].size();i++) {
int vecin=adiacenta[nod][i];
if(use[vecin]==0)
dfs(vecin);
}
}
int main() {
citire();
for(int i=1;i<=n;i++) {
if(use[i]==0) {
conexe++;
dfs(i);
}
}
fout<<conexe;
}