Cod sursa(job #2072935)
| Utilizator | Data | 22 noiembrie 2017 14:44:09 | |
|---|---|---|---|
| Problema | Parcurgere DFS - componente conexe | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.62 kb |
#include <fstream>
#include <vector>
using namespace std;
ifstream f("dfs.in");
ofstream g("dfs.out");
vector<int>adj[200001];
int viz[200001],n,m,a,b,nr;
void dfs(int nod)
{
viz[nod]=1;
for(int i=0;i<adj[nod].size();i++)
{
if(!viz[adj[nod][i]])
{
dfs(adj[nod][i]);
}
}
}
int main()
{
f>>n>>m;
for(int i=1;i<=m;i++)
{
f>>a>>b;
adj[a].push_back(b);
adj[b].push_back(a);
}
for(int i=1;i<=n;i++)
{
if(viz[i]==0)
{
dfs(i);nr++;
}
}
g<<nr;
return 0;
}
