DFS(邻接矩阵存储)

/************
date:2023-03-05
version:1.0
author:lr
Description:采用邻接矩阵存储图，进行图的深度优先搜索并输出结果
**************/

#include<stdio.h>
#include<stdlib.h>
#define MAX 100
typedef struct {
	int vexnum, arcnum;
	int vertex[MAX];//顶点表
	int arcs[MAX][MAX];//邻接矩阵
}graph,*Graph;
typedef struct Arc {
	int v1;
	int v2;
	int weight;
}*ArcType;
int Init_Vex() {
	int vexnum;
	printf("请输入顶点个数:\n");
	scanf_s("%d", &vexnum);
	//G->vexnum = vexnum;
	return vexnum;
}
int Init_Arc( ) {
	int arcnum;
	printf("请输入边个数:\n");
	scanf_s("%d", &arcnum);
	//G->arcnum = arcnum;
	return arcnum;
}
void InitG(Graph G, int Vertex) {
	G->vexnum = Vertex;
	G->arcnum = 0;
	for (int i = 0; i < Vertex; i++) {
		for (int j = 0; j < Vertex; j++) {
			G->arcs[i][j] = 0;
		}
	}

}

void InWeight(Graph G, ArcType T);
void InSerG(Graph G, int edge, int V) {
	printf("输入顶点和权值：\n");
	if (edge > 0) {
		for (int i = 0; i < edge; i++)
		{
			ArcType A = (ArcType)malloc(sizeof(struct Arc));
			scanf_s("%d%d%d", &(A->v1), &(A->v2), &(A->weight));
			InWeight(G, A);
		}
	}
	printf("请输入顶点：\n");
	for (int i = 0; i < V; i++) {
		scanf_s("%d", &G->vertex[i]);
	}
	
}
void InWeight(Graph G, ArcType T) {
	G->arcs[T->v1][T->v2] = T->weight;
	G->arcs[T->v2][T->v1] = T->weight;
}
/* 输出邻接矩阵 */
void Print(Graph p, int Vertex)
{
	int i, j;
	for (i = 0; i < Vertex; i++)
	{
		for (j = 0; j < Vertex; j++)
		{
			printf("%4d", p->arcs[i][j]);	//	打印邻接矩阵 
		}
		putchar('\n');
	}
}
int visited[MAX];
void DFS(Graph G,int v,int Vexnum) {
	visited[v] = 1;
	printf("%d", G->vertex[v]);
	for (int i = 0; i < Vexnum; i++) {
		if (!visited[i]&&G->arcs[v][i]!=0) {
			DFS(G, i, Vexnum);
		}
	}
}
void InitDFS(Graph G,int Vexnum) {
	for (int i = 0; i < Vexnum; i++) {
		visited[i] = 0;
	}
	for (int i = 0; i < Vexnum; i++) {
		if (!visited[i]) {
			DFS(G, i, Vexnum);
		}
	}
}
int main() {
	Graph G;
	
	int arcnum, vexnum;
	arcnum = Init_Arc();
	
	vexnum = Init_Vex();
	G = (Graph)malloc(sizeof(graph));
	G->arcnum = arcnum;
	G->vexnum = vexnum;
	InitG(G, vexnum);
	InSerG(G, arcnum, vexnum);
	Print(G, vexnum);
	InitDFS(G, vexnum);
	return 0;
	}