Pagini recente » Istoria paginii runda/simulare-cartita-23/clasament | Cod sursa (job #1268080) | Cod sursa (job #824477) | Cod sursa (job #170650) | Cod sursa (job #694007)
Cod sursa(job #694007)
#include<fstream>
#include<vector>
using namespace std;
#define nm 100005
int n, m, s, viz[nm],comp;
vector <int> v[nm];
ifstream f("dfs.in");
ofstream g("dfs.out");
void citire()
{
int x,y;
f>>n>>m;
while(f>>x>>y) {v[x].push_back(y);v[y].push_back(x);}
}
void dfs(int s)
{
int st[nm],p,nod,i,y;
p=1;
st[p]=s;
viz[s]=1;
while(p>=1)
{
nod=st[p];
y=0;
for(i=0;i<v[nod].size();i++)
{
if(viz[v[nod][i]]==0){y=v[nod][i];break;}
}
if(y!=0)
{
p++;
st[p]=y;
viz[y]=1;
}
else p--;
}
}
int main()
{
int i;
citire();
for(i=1;i<=n;i++)if(!viz[i]){comp++;dfs(i);}
g<<comp;
}