图的邻接表表示、头插法建立图、深度优先遍历、广度优先遍历

图的邻接表表示、头插法建立图、深度优先遍历、广度优先遍历

代码：

#include<iostream>
#include<queue>
#define Maxsize 100
using namespace std;
int book1[Maxsize] = { 0 };
int book2[Maxsize] = { 0 };
int book3[Maxsize] = { 0 };
int visited[Maxsize] = { 0 };
int sum = 0;

//邻接表存储结构 
struct ArcNode
{
	int adjvex;
	ArcNode* nextarc;
};

struct Vnode
{
	int data;
	ArcNode* firstarc;//顶点指针 
};

struct AGraph
{
	Vnode adjlist[Maxsize];
	int numver, numedg;//顶点数n 边数e 
};

AGraph* G = new AGraph;

void InitAGraph(int n1, int e1) {//头插法建立图 
	G->numver = n1;
	G->numedg = e1;
	for (int i = 0; i < n1; ++i) {//初始化顶点 
		G->adjlist[i].data = i;
		G->adjlist[i].firstarc = NULL;
	}
	for (int i = 0; i < e1; ++i) {
		int v1, v2;
		cout << "第" << i + 1 << "次输入：" << endl;
		cin >> v1 >> v2;
		ArcNode* p = new ArcNode;
		p->adjvex = v2;
		p->nextarc = G->adjlist[v1].firstarc;
		G->adjlist[v1].firstarc = p;
		//如果是无向图 则需要插入两次 有向图只需要执行上述操作 
		ArcNode* q = new ArcNode;
		q->adjvex = v1;
		q->nextarc = G->adjlist[v2].firstarc;
		G->adjlist[v2].firstarc = q;
	}

}

void BFS1(int v, int book[]) //广度优先遍历，v为遍历的开始节点 
{
	queue<int> que;//C++中自带的queue
	que.push(v);//让起始节点入队 
	book[v] = 1;//将这个节点变为被访问 
	while (!que.empty()) {//如果队不空 就循环 
		int t = que.front();//读取第一个队列元素 并出队 
		que.pop();
		cout << t << ' '; //打印出队的元素 
		ArcNode* p = G->adjlist[t].firstarc;//定义指向边节点的指针 
		while (p) {
			if (book[p->adjvex] == 0)
			{
				que.push(p->adjvex);
				book[p->adjvex] = 1;
			}
			p = p->nextarc;
		}
	}
}
void BFS2(int v, int book[]) //广度优先遍历，v为遍历的开始节点 
{
	int que[Maxsize];//数组模拟队列 
	int front = 0, rear = 0;
	que[++rear] = G->adjlist[v].data;
	book[v] = 1;
	while (rear != front) {
		int t = que[++front];
		cout << t << ' ';
		ArcNode* p = G->adjlist[t].firstarc;
		while (p) {
			if (book[p->adjvex] == 0)
			{
				que[++rear] = p->adjvex;
				book[p->adjvex] = 1;
			}
			p = p->nextarc;
		}
	}
}

void DFS1(int v, int book[]) {//深度优先遍历 
	if (book[v] == 0) { //打印顶点 
		cout << v << ' ';
		++sum;
		book[v] = 1;
		if (sum == G->numedg) return;
	}
	for (ArcNode* p = G->adjlist[v].firstarc; p != NULL; p = p->nextarc)
	{
		if (book[p->adjvex] == 0) {
			cout << p->adjvex << ' ';
			++sum;
			book[p->adjvex] = 1;
			if (sum == G->numedg) return;
			else DFS1(p->adjvex, book);
		}
	}
}

void DFS2(int v) {//输入图结构头结点与起始结点位置
	cout << v << ' ';//访问顶点v
	visited[v] = 1;//设置v已访问
	ArcNode* p = G->adjlist[v].firstarc;//指向连接起始位置的第一条边
	//从邻边出发，遍历图
	while (p != nullptr) {
		if (visited[p->adjvex] == 0) {//寻找未被访问过的邻点,递归遍历
			DFS2(p->adjvex);
		}
		p->nextarc;//当前结点的所有邻边遍历完成，前往下一条边
	}
	return;
}
int main() {

	int n, e;
	cout << "请输入顶点的个数和边的个数：";
	cin >> n >> e;
	InitAGraph(n, e);
	BFS1(0, book1);
	cout << endl;
	BFS2(0, book2);
	cout << endl;
	DFS1(0, book3);
	cout << endl;
	//DFS2(0);//会卡壳 等待补充
	return 0;
}

DFS1是我自己写的，DFS2是通用的，但是DFS2我实际运行以后发现会卡住，不知道是不是死循环了。

运行结果：