Pagini recente » Cod sursa (job #2597150) | Cod sursa (job #1394312) | Cod sursa (job #14070) | Cod sursa (job #1359886) | Cod sursa (job #2678078)
#include <fstream>
#include <vector>
using namespace std;
ifstream f("dfs.in");
ofstream g("dfs.out");
vector<int> graf[100005];
int n, m;
bool viz[100005];
void citire()
{
f>>n>>m;
int x, y;
for(int i = 1; i<=m; i++)
{
f>>x>>y;
graf[x].push_back(y);
graf[y].push_back(x);
}
}
void dfs(int currNode)
{
viz[currNode] = true;
for(auto &i : graf[currNode])
{
if(!viz[i])
{
dfs(i);
}
}
}
void rez()
{
int nrComp = 0;
for(int i = 1; i<=n; i++)
{
if(!viz[i])
{
nrComp++;
dfs(i);
}
}
g<<nrComp;
}
int main()
{
citire();
rez();
return 0;
}