Pagini recente » Cod sursa (job #123220) | Cod sursa (job #1939412) | Cod sursa (job #2259176) | Cod sursa (job #603820) | Cod sursa (job #1652090)
#include <fstream>
#include <vector>
using namespace std;
ifstream in("dfs.in");
ofstream out("dfs.out");
vector<int> a[100005];
int n,m;
int marcaj[100005];
void DFS(int nod)
{
marcaj[nod]=1;
for(int i=0;i<a[nod].size();i++)
{
if(!(marcaj[a[nod][i]]))
DFS(a[nod][i]);
}
}
int main()
{
int i,x,y;
int nr=0;
in>>n>>m;
for(i=1;i<=m;i++){
in>>x>>y;
a[x].push_back(y);
a[y].push_back(x);
}
for(i=1;i<=n;i++)
{
if(!(marcaj[i]))
{
DFS(i);
nr++;
}
}
out<<nr;
in.close();
out.close();
return 0;
}