深度优先遍历算法

#include<iostream>
using namespace std;

//定义图的最大节点数
#define MAX_NODES 100

//定义图的邻接表节点：节点数据以及指向下一个结点的指针
struct Node
{
	int date;
	struct Node* next;
};

//定义图:节点个数、数组（最大节点个数大小）以及是否被遍历过
struct Graph
{
	int numNodes;
	struct Node* adjacencyList[MAX_NODES];
	int visited[MAX_NODES];

};

//初始化图
void initGraph(struct Graph* graph,int numNodes)
{
	graph->numNodes = numNodes;
	for (int i = 0; i < numNodes; i++) {
		graph->adjacencyList[i] = NULL;
		graph->visited[i] = 0;
	}
};

//添加边
void addEdge(struct  Graph* graph, int src, int dest)
{
	//创建邻接表节点
	struct Node* newNode = (struct Node*)malloc(sizeof(Node));
	newNode->date = dest;
	newNode->next = graph->adjacencyList[src];

};