Cod sursa(job #2881788)
Utilizator | aelius dinca aeliusdinca | Data | 30 martie 2022 20:56:12 |
---|---|---|---|
Problema | Parcurgere DFS - componente conexe | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.57 kb |
#include<fstream>
#include<vector>
using namespace std;
ifstream in("dfs.in");
ofstream out("dfs.out");
vector<int> v[100001];
int cc,viz[100001];
void dfs(int nod)
{
viz[nod]=1;
for(int i=0;i<v[nod].size();i++)
{
if(viz[v[nod][i]]==0)
dfs(v[nod][i]);
}
}
int main()
{
int n,m,i,a,b;
in>>n>>m;
for(i=1;i<=m;i++)
{
in>>a>>b;
v[a].push_back(b);
v[b].push_back(a);
}
for(i=1;i<=n;i++)
{
if(viz[i]==0)
dfs(i),cc++;
}
out<<cc;
return 0;
}