Pagini recente » Cod sursa (job #3224926) | vanghelion-1 | Cod sursa (job #23375) | Cod sursa (job #3003298) | Cod sursa (job #2671809)
#include <fstream>
#include <vector>
#include <bitset>
using namespace std;
ifstream f("dfs.in");
ofstream g("dfs.out");
int n,m,x,y,componente;
vector <int> mat[100003];
bool viz[100001];
void DFS(int x)
{
for(int i = 0; i < mat[x].size(); ++ i)
if(!viz[mat[x][i]])
{
viz[mat[x][i]] = 1;
DFS(mat[x][i]);
}
}
int main()
{
f >> n >> m;
while(m -- )
{
f >> x >> y;
mat[x].push_back(y);
mat[y].push_back(x);
}
for(int i = 1; i <= n; ++ i)
if(!viz[i])
{
++ componente;
viz[i] = 1;
DFS(i);
}
g << componente;
}