DFS 深度优先搜索

#include <iostream>
#include <algorithm>
#include <string>
using namespace std;
int **graph;
int N;
int *map;
int num = 0;

void DFS(int v)
{
	num++;
	map[v] = 1;
	/*for (int i = 0; i < N; ++i)
		cout << map[i] << "  ";
		cout << endl;
		for (int i = 0; i < N; ++i)
		{
		for (int j = 0; j < N; ++j)
		{
		cout << graph[i][j];

		}
		cout << endl;
		}
		cout << endl;*/
	
	for (int i = 0; i < N; ++i)
	{
		if (graph[v][i] == 1 && map[i] == 0)
			DFS(i);
	}
	
}
int main()
{
	
	cin >> N;
	
	map = new int[N];
	graph = new int *[N];
	for (int i = 0; i < N; ++i)
		graph[i] = new int[N];
	for (int i = 0; i < N; ++i)
	{
		for (int j = 0; j < N; ++j)
		{
			graph[i][j] = 0;

		}
		map[i] = 0;
	}
	int x, y;
	for (int i = 0; i < N-1; ++i)
	{
		
		cin >> x >> y;
		graph[x - 1][y - 1] = 1;
		//graph[y-1][x-1] = 1;
	}
	DFS(0);
	cout << num;
	
	return 0;
}