Cod sursa(job #1324040)
Utilizator | Lazar Alexandru Stickman | Data | 21 ianuarie 2015 19:04:13 |
---|---|---|---|
Problema | Parcurgere DFS - componente conexe | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.64 kb |
#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
ifstream in("dfs.in");
ofstream out("dfs.out");
vector <int> v[100001];
int cost[100001], nr, n, m, x, y;
void dfs(int nod)
{
cost[nod]=1;
for(int k=0; k<v[nod].size(); k++)
if(cost[v[nod][k]]==0)
dfs(v[nod][k]);
}
int main()
{
in>>n>>m;
for(int i=0; i<m; i++)
{
in>>x>>y;
v[x].push_back(y);
v[y].push_back(x);
}
for(int i=1; i<=n; i++)
if(cost[i]==0)
{
dfs(i);
nr++;
}
out<<nr;
return 0;
}