Pagini recente » Cod sursa (job #1295823) | Cod sursa (job #2146382) | Cod sursa (job #1876626) | Cod sursa (job #235733) | Cod sursa (job #942415)
Cod sursa(job #942415)
#include<fstream>
#include<vector>
using namespace std;
ifstream fin("dfs.in");
ofstream fout("dfs.out");
const int MAXN = 100010;
vector <int> v[MAXN];
int n, m, x, y, nr;
bool used[MAXN];
void dfs(int u)
{
used[u]=1;
for(vector<int> :: iterator i=v[u].begin(); i<v[u].end() ; ++i)
if(used[*i] == 0)
dfs(*i);
}
int main(){
int i;
fin >> n >> m;
for(i=0; i<m; ++i){
fin >> x >> y;
v[x].push_back(y);
v[y].push_back(x);
}
for(int i=1 ; i<=n ; ++i)
if(used[i] == 0)
++nr , dfs(i);
fout << nr;
fin.close();
fout.close();
return 0;
}