Cod sursa(job #2034172)
Utilizator | Irsai Samuel SamySam2099 | Data | 7 octombrie 2017 15:40:42 |
---|---|---|---|
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");
vector<int>G[100005];
void citire(int m)
{
int x,y;
for(int i=1;i<=m;i++)
{
f>>x>>y;
G[x].push_back(y);
G[y].push_back(x);
}
}
bool viz[100005];
int ok;
void DFS(int nod)
{
viz[nod]=true;
for(int i=0;i<G[nod].size();i++)
{
if(!viz[G[nod][i]]) DFS(G[nod][i]);
}
}
int main()
{
int n,m;
f>>n>>m;
citire(m);
for(int i=1;i<=n;i++)
{
if(!viz[i]) {DFS(i);ok++;}
}
g<<ok;
return 0;
}