Cod sursa(job #2209481)
Utilizator | Bejenariu Ionut Daniel ionut98 | Data | 3 iunie 2018 16:40:17 |
---|---|---|---|
Problema | Parcurgere DFS - componente conexe | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.6 kb |
#include<fstream>
#include<vector>
using namespace std;
ifstream f("dfs.in");
ofstream g("dfs.out");
int n,m,x,y;
vector<int>v[100001];
bool 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()
{
f>>n>>m;
while(m--)
{
f>>x>>y;
v[x].push_back(y);
v[y].push_back(x);
}
int con=0;
for(int i=1;i<=n;i++)
if(viz[i]==0)
{
con++;
dfs(i);
}
g<<con;
return 0;
}