C++实现图的深度优先遍历算法完整代码

要遍历的图如上图所示
采用邻接表实现

#include <iostream>
using namespace std;
#include<stdlib.h>
# define maxSize 10

typedef struct ArcNode{		//边表结点
	int adjvex;				//是这条边所指向的下一个结点的数组下标
	struct ArcNode *nextarc;
	//int info;				//如果有权值就使用
}ArcNode;

typedef struct{				//顶点表结点
	char data;
	ArcNode *firstarc;  	//指向第一条边的指针
}VNode;

typedef struct
{
	VNode *adjlist[maxSize];
	int n,e;				//顶点数和边数
}AGraph;

/*图的深度优先遍历算法
这里要遍历的图如上图所示
*/

int visit[maxSize];			//全局数组，作为顶点访问的标记，初始全部为0，

//产生邻接表
void createGraph(AGraph *&graph)
{
	/*
		上图中有5个顶点，A,B,C,D,E,且规定他们的数组下标为0,1,2,3,4
	*/
	ArcNode *ba, *bc, *cd, *ce;//定义了上图的BA边，BC边..
	ba = (ArcNode*)malloc(sizeof(ArcNode));
	bc = (ArcNode*)malloc(sizeof(ArcNode));
	cd = (ArcNode*)malloc(sizeof(ArcNode));
	ce = (ArcNode*)malloc(sizeof(ArcNode));
	ba->adjvex = 0;				//因为BA边指向的下一个结点是A，A的数组下标为0
	bc->adjvex = 2;
	cd->adjvex = 3;
	ce->adjvex = 4;
	ba->nextarc = bc;
	bc->nextarc = NULL;
	cd->nextarc = ce;
	ce->nextarc = NULL;
	VNode *a, *b, *c, *d, *e;  //定义5个顶点表结点
	a = (VNode*)malloc(sizeof(VNode));
	b = (VNode*)malloc(sizeof(VNode));
	c = (VNode*)malloc(sizeof(VNode));
	d = (VNode*)malloc(sizeof(VNode));
	e = (VNode*)malloc(sizeof(VNode));
	a->data = 'A';
	b->data = 'B';
	c->data = 'C';
	d->data = 'D';
	e->data = 'E';
	a->firstarc = NULL;
	b->firstarc = ba;
	c->firstarc = cd;
	d->firstarc = NULL;
	e->firstarc = NULL;
	graph = (AGraph*)malloc(sizeof(AGraph));
	graph->n = 5;
	graph->e = 4;
	graph->adjlist[0] = a;
	graph->adjlist[1] = b;
	graph->adjlist[2] = c;
	graph->adjlist[3] = d;
	graph->adjlist[4] = e;
	
}
//深度优先遍历算法
void DFS(AGraph *G, int v)
{
	ArcNode *p;
	visit[v] = 1;
	//可以对下标v的结点访问操作了，这里访问结点的操作是打印英文序号A，B..
	cout << G->adjlist[v]->data << endl;
	
	p = G->adjlist[v]->firstarc;
	while (p != NULL)
	{
		if(visit[p->adjvex] == 0) //若顶点未被访问，则递归访问他；
		{
			DFS(G, p->adjvex);
			p = p->nextarc;
		}
	}
	
}


int main()
{   
	AGraph *graph;
	createGraph(graph);
	
	DFS(graph, 1);
	
	return 0;
}

输出：