数据结构：图的存储和遍历

内容：实现图的邻接矩阵存储和邻接表存储以及DFS(深度优先搜索)和BFS(广度优先搜索)

注：

1. 一定要初始化，一定要初始化，一定要初始化，重要的事情说三遍，数组不初始化录入出问题，队列不初始化找不到头尾，指针不初始化完全或者不给结尾加NULL会炸内存。
2. 思路上DFS用递归，类似先序遍历，BFS用队列，类似于层序遍历
3. 在调用visited数组时一定要在主函数或者定义全局变量，否则visited一直是0，一直死循环。
4. 本程序的结点名仅限于从1开始的1~19之间的结点。

主函数+两个头文件：

#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#define MAX_VERTEX_NUM 20
#define maxsize 20

typedef struct Enum {
	char kind[2] = {'\0'};   //DG  AG    有向图 无向图
}GraphKind;

typedef struct information {
	int point=0;		//结点名“整形”
	struct information* next;
}InfoType;

typedef struct ArCell {
	int adj=0;		//邻接or not
	InfoType* info=(InfoType*)malloc(sizeof(InfoType));
}AdjMatrix[MAX_VERTEX_NUM][MAX_VERTEX_NUM];		//邻接矩阵

typedef struct V {
	int start=0;		//弧尾
	int end=0;		//弧头
}VertexType;

typedef struct G {
	VertexType vexs[MAX_VERTEX_NUM];		//向量
	AdjMatrix arcs;
	int vexnum=0;    //顶点数
	int arcnum=0;	//弧数
	GraphKind kind;		//种类标志
}MGraph;

typedef int elemtype;
typedef struct qn {
	elemtype data[maxsize] = { 0 };
	elemtype front;
	elemtype rear;
}linkqn;
#include"queue.h"
#include"MGraph.h"

int main() {
	MGraph g;
	int visited[MAX_VERTEX_NUM] = { 0 };
	linkqn q;
	Create(&g);
	Display(&g);
	printf("DFS: ");
	DFS(&g, 1, visited);
	printf("BFS: ");
	initqueue(&q);
	int visited1[MAX_VERTEX_NUM] = { 0 };
	DPS(&g, 1, &q, visited1);
}




//MGraph.h


#pragma once
void DPS(MGraph* g, int n, linkqn* q, int* visited) {
	InfoType* p;
	enterqueue(q, n);
	visited[n]++;
	while (!Qisempty(q)) {
		int i;
		i = deletequeue(q);
		printf("%d ", i);
		p = g->arcs[i][0].info->next;
		while (p) {
			if (visited[p->point] == 0) {
				enterqueue(q, p->point);
				visited[p->point]++;
			}
			p = p->next;
		}
	}
	printf("\n");
	return;
}

void DFS(MGraph* g, int n, int* visited) {
	InfoType* p;
	visited[n]++;
	printf("%d ", n);
	p = g->arcs[n][0].info->next;

	while (p) {
		if (visited[p->point] == 0) {
			DFS(g, p->point, visited);
			return;
		}
		else {
			p = p->next;
		}
	}
	if (p == NULL) {
		for (int i = 1; i <= g->vexnum; i++) {
			if (visited[i] == 0) {
				DFS(g, i, visited);
			}
		}
	}
	printf("\n");
	return;
}

void EnterDG(MGraph* g) {
	printf("输入顶点数和边数\n");
	scanf_s("%d %d", &g->vexnum, &g->arcnum);
	for (int i = 0; i < MAX_VERTEX_NUM; i++) {
		for (int j = 0; j < MAX_VERTEX_NUM; j++) {
			g->arcs[i][j].adj = 0;
			g->arcs[i][j].info->point = j;
		}
	}
	printf("输入各边的两个顶点\n");		//1~19
	for (int i = 0; i < g->arcnum; i++) {
		scanf_s("%d %d", &g->vexs[i].start, &g->vexs[i].end);
	}
	for (int i = 0; i < g->arcnum; i++) {
		g->arcs[g->vexs[i].start][g->vexs[i].end].adj = 1;
	}

	for (int i = 1; i <= g->vexnum; i++) {
		InfoType* p;
		p = g->arcs[i][0].info;
		for (int j = 1; j <= g->vexnum; j++) {
			if (g->arcs[i][j].adj) {
				p->next = g->arcs[i][j].info;
				p = p->next;
			}
		}
		p->next = NULL;
	}
}

void EnterAG(MGraph* g) {
	printf("输入顶点数和边数\n");
	scanf_s("%d %d", &g->vexnum, &g->arcnum);
	for (int i = 0; i < MAX_VERTEX_NUM; i++) {
		for (int j = 0; j < MAX_VERTEX_NUM; j++) {
			g->arcs[i][j].adj = 0;
			g->arcs[i][j].info->point = j;
		}
	}
	printf("输入各边的两个顶点\n");		//1~19
	for (int i = 0; i < g->arcnum; i++) {
		scanf_s("%d %d", &g->vexs[i].start, &g->vexs[i].end);
	}
	for (int i = 0; i < g->arcnum; i++) {
		g->arcs[g->vexs[i].start][g->vexs[i].end].adj = 1;
		g->arcs[g->vexs[i].end][g->vexs[i].start].adj = 1;
	}

	for (int i = 1; i <= g->vexnum; i++) {
		InfoType* p;
		p = g->arcs[i][0].info;
		for (int j = 1; j <= g->vexnum; j++) {
			if (g->arcs[i][j].adj) {
				p->next = g->arcs[i][j].info;
				p = p->next;
			}
		}
		p->next = NULL;
	}
}
int changekind(MGraph* g) {
	int kind;
	while (1) {
		printf("1：无向图，2：有向图\n");
		scanf_s("%d", &kind);
		if (kind == 1) {
			g->kind.kind[0] = 'A';
			g->kind.kind[1] = 'G';
			return 1;
		}
		else if (kind == 2) {
			g->kind.kind[0] = 'D';
			g->kind.kind[1] = 'G';
			return 2;
		}
		else {
			printf("种类不合法！\n");
		}
	}
}

void Create(MGraph* g) {
	int kind;
	kind = changekind(g);
	if (kind == 1) {
		EnterAG(g);
	}
	else {
		EnterDG(g);
	}

	return;
}

void Display(MGraph* g) {
	printf("\n邻接矩阵:\n");
	for (int i = 1; i <= g->vexnum; i++) {
		for (int j = 1; j <= g->vexnum; j++) {
			printf("%d ", g->arcs[i][j].adj);
		}
		printf("\n");
	}
	printf("\n");

	printf("邻接表:\n");
	for (int i = 1; i <= g->vexnum; i++) {
		InfoType* p;
		p = g->arcs[i][0].info->next;
		while (p) {
			printf("%d ", p->point);
			p = p->next;
		}
		printf("\n");
	}
	printf("\n");

}




//queue.h

#pragma once
int initqueue(linkqn*p) {
	p->front = p->rear = 0;
	return 1;
}
int Qisfull(linkqn* p) {
	if (p->front - p->rear == maxsize - 1) {
		return 1;
	}
	return 0;
}
int Qisempty(linkqn* p) {
	if (p->front == p->rear) {
		return 1;
	}
	return 0;
}
void enterqueue(linkqn* p,elemtype x){
	if (Qisfull(p)) { printf("队满，无法入队\n"); return; }
	p->data[p->rear]=x;
	p->rear=(p->rear+1+maxsize)%maxsize;
}
elemtype deletequeue(linkqn* p) {
	int i;
	if (Qisempty(p)) { printf("队空，无法出队\n"); return 0; }
 i=p->data[p->front];
	p->front = (p->front+1+maxsize) % maxsize;
	return i;
}
elemtype Qfront(linkqn* p) {
	if (Qisempty(p)) {
		printf("队空，无法读取\n");
	}
	return p->front;
}
elemtype Qrear(linkqn* p) {
	if (Qisempty(p)) {
		printf("队空，无法读取\n");
	}
	return p->rear;
}