Pagini recente » Cod sursa (job #286700) | Cod sursa (job #896815) | Cod sursa (job #2011649) | Cod sursa (job #2385169) | Cod sursa (job #3318463)
#include <fstream>
#include <vector>
using namespace std;
ifstream f("dfs.in");
ofstream g("dfs.out");
vector<int>L[100001];
int N,M,cc,vis[100001];
void DFS(int nod)
{
vis[nod]=1;
for(int v=0;v<L[nod].size();v++)
if(vis[L[nod][v]]==0)
DFS(L[nod][v]);
}
int main()
{
int x,y;
f>>N>>M;
for(int i=1;i<=M;i++)
{
f>>x>>y;
L[x].push_back(y);
L[y].push_back(x);
}
cc=0;
for(int i=1;i<=N;i++)
if(vis[i]==0)
{
DFS(i);
cc++;
}
g<<cc;
return 0;
}