Pagini recente » Cod sursa (job #836523) | Cod sursa (job #2951814) | Cod sursa (job #1178848) | Borderou de evaluare (job #2847941) | Cod sursa (job #768632)
Cod sursa(job #768632)
//Parcurgere DFS
# include <fstream>
using namespace std;
ifstream f("dfs.in");
ofstream g("dfs.out");
# define MAXN 100001;
int N,M,A[MAXN][MAXN],viz[MAXN],c=1;
void citire()
{
f>>N>>M;
while (!f.eof())
{
int x,y;
f>>x>>y;
a[x][y]=1;
a[y][x]=1;
f.close();
}
}
void DFS(int x,int&c)
{
viz[x]=1;
for (int i=1; i<=N; i++)
if(a[x][i]==1 && viz[i]==0)
{
c++;
DFS(i);
}
}
int main()
{
DFS(1,c);
if(c!=1)
g<<c;
g.close();
return 0;
}