深度优先搜索DFS代码实现

Init.h文件

#ifndef INIT

#include<stdio.h>
#include<stdlib.h>

constexpr auto MaxVertexNum = 100;

typedef int Ver; //顶点下标
typedef int WeigthType; //边的权值
typedef int DataType; //顶点的数据类型



//边的定义
typedef struct ENode {
	Ver v1, v2;
	WeigthType weigth;
}*PtrToENode;
typedef PtrToENode Edge;

//邻接点定义
typedef struct AdjVNode {
	Ver AdjV; //邻接点的下标
	WeigthType weight; //边的权重
	struct AdjVNode* Next; //下一个邻接点
}*PtrToAdjVNode;

//表头节点定义
typedef struct VNode {
	PtrToAdjVNode FirstEdge;
	DataType Data; //可不用
}AdjList[MaxVertexNum];

// 图结点的定义 
typedef struct GNode {
	int Nv;     /* 顶点数 */
	int Ne;     /* 边数   */
	AdjList G;  /* 邻接表 */
}*PtrToGNode;
typedef PtrToGNode LGraph;


void DFS(LGraph Graph, Ver V);
LGraph BuildGraph();//构建一个图
void InsertEdge(LGraph Graph, Edge E);//插入一条边

#endif // !INIT

DFS.CPP文件

#include"Init.h"

bool Visited[MaxVertexNum] = { false };

// 初始化没有边的图
LGraph CreatGraph(int VertexNum)
{
	Ver V;
	LGraph Graph;

	Graph = (LGraph)malloc(sizeof(struct GNode));
	Graph->Nv = VertexNum;
	Graph->Ne = 0;

	for (V = 0; V < Graph->Nv; V++)
		Graph->G[V].FirstEdge = NULL;

	return Graph;
}

//插入一条边
void InsertEdge(LGraph Graph, Edge E)
{
	PtrToAdjVNode newNode;

	newNode = (PtrToAdjVNode)malloc(sizeof(struct AdjVNode));
	newNode->AdjV = E->v2;
	newNode->weight = E->weigth;
	newNode->Next = Graph->G[E->v1].FirstEdge;
	Graph->G[E->v1].FirstEdge = newNode;

	newNode = (PtrToAdjVNode)malloc(sizeof(struct AdjVNode));
	newNode->AdjV = E->v1;
	newNode->weight = E->weigth;
	newNode->Next = Graph->G[E->v2].FirstEdge;
	Graph->G[E->v2].FirstEdge = newNode;
}

//构建一个图
LGraph BuildGraph()
{
	int Nv, i;
	Ver V;
	Edge E;
	LGraph Graph;

	printf_s("请输入插入节点的个数\n");
	scanf_s("%d", &Nv);

	Graph = CreatGraph(Nv);

	printf_s("请输入插入边的个数\n");
	scanf_s("%d", &(Graph->Ne));
	if (Graph->Ne != 0)
	{
		E = (Edge)malloc(sizeof(struct ENode));
		if (!E)
		{
			printf("E生成失败");
			exit(-1);
			return NULL;
		}
		for (i = 0; i < Graph->Ne; i++)
		{
			printf("请输入第%d条边:  V1,V2,权重\n", i);
			scanf_s("%d %d %d", &(E->v1), &(E->v2), &(E->weigth));
			InsertEdge(Graph, E);
		}
	}

	for (V = 0; V < Graph->Nv; V++)
	{
		printf("请输入第%d个顶点的数据\n", V);
		scanf_s("%d", &(Graph->G[V].Data));
	}

	return Graph;
}


/* 邻接表存储的图 - DFS */

void Visit(Ver V)
{
	printf("正在访问顶点%d\n", V);
}

/* Visited[]为全局变量，已经初始化为false */
void DFS(LGraph Graph, Ver V)  //void表示任意类型
{   
	/* 以V为出发点对邻接表存储的图Graph进行DFS搜索 */
	PtrToAdjVNode W;

	Visit(V); /* 访问第V个顶点 */
	Visited[V] = true; /* 标记V已访问 */

	for (W = Graph->G[V].FirstEdge; W; W = W->Next) /* 对V的每个邻接点W->AdjV */
		if (!Visited[W->AdjV])    /* 若W->AdjV未被访问 */
			DFS(Graph, W->AdjV);    /* 则递归访问之 */
}

main.cpp文件

#include"Init.h"

extern bool Visited[MaxVertexNum];

void main()
{
	printf("无向图\n");
	LGraph Graph;
	Graph = BuildGraph();
	DFS( Graph, 1);
}