Cod sursa(job #2243227)
Utilizator | Stegarus Petre peterst | Data | 20 septembrie 2018 09:59:43 |
---|---|---|---|
Problema | Parcurgere DFS - componente conexe | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.64 kb |
#include <fstream>
#include <vector>
#define nmax 100002
using namespace std;
ifstream fin("dfs.in");
ofstream fout("dfs.out");
int n,m,x,y,vizitat[nmax],k;
vector<int> v[nmax];
void dfs(int u)
{
vizitat[u]=1;
for(vector<int>::iterator it = v[u].begin(); it != v[u].end(); it++)
if(!vizitat[*it])
dfs(*it);
}
int main()
{
fin>>n>>m;
for(int i=0; i<m; ++i)
{
fin>>x>>y;
v[x].push_back(y);
v[y].push_back(x);
}
for(int i=1; i<=n; ++i)
if(!vizitat[i])
{
++k;
dfs(i);
}
fout<<k;
return 0;
}