Pagini recente » Cod sursa (job #177209) | Cod sursa (job #1870345) | Cod sursa (job #1278272) | Cod sursa (job #671553) | Cod sursa (job #2282038)
#include <fstream>
#define MAXN 100
using namespace std;
struct nod{int val; nod *next;};
nod *nou;
int cnt = 0, viz[MAXN], n;
nod *L[MAXN];
void add(int x, int y)
{
nou = new nod;
nou -> val = y;
nou -> next = L[x];
L[x] = nou;
}
ofstream g("dfs.out");
void df(int nodul)
{
nod *t;
viz[nodul] = 1;
for(t = L[nodul]; t; t = t -> next)
if(!viz[t->val])
df(t -> val);
}
int main()
{
int i,m,x,y;
ifstream f("dfs.in");
f >> n >> m;
while(m--)
{
f >> x >> y;
add(x,y);
add(y,x);
}
f.close();
for(i = 1; i <= n; i++)
if(viz[i] == 0)
{
cnt++;
df(i);
}
g << cnt;
g.close();
return 0;
}