Pagini recente » Cod sursa (job #2501922) | Cod sursa (job #2405221) | Cod sursa (job #2424668) | Cod sursa (job #3229887) | Cod sursa (job #2811590)
#include<fstream>
#include<vector>
using namespace std;
ifstream fin("dfs.in");
ofstream fout("dfs.out");
int n,m,i,v,u,k;
vector<int> adj[100005];
bool ver[100005];
void dfs(int x)
{
ver[x]=1;
for(int i=0;i<adj[x].size();i++)
{
if(ver[adj[x][i]]==0)
dfs(adj[x][i]);
}
}
int main()
{
fin>>n>>m;
for(i=1;i<=m;++i)
{
fin>>v>>u;
adj[v].push_back(u);
adj[u].push_back(v);
}
for(i=1;i<=n;i++)
{
if(ver[i]==0)
{
k++;
dfs(i);
}
}
fout<<k;
return 0;
}