(C语言浙大版)图的深优搜索DFS(邻接矩阵含测试用例)

本博文源于浙江大学《数据结构》，主要完成了图的深度优先搜索，根据姥姥课上讲解内容，一步步完成，深度优先搜索源码如下(文末完整代码)：
我想对这样一个图进行遍历：

输入用例应该如下：

8 10
0 5 1
0 7 1
0 2 1
1 7 1
2 6 1
3 5 1
3 4 1
4 5 1
4 6 1
4 7 1

遍历结果如下

#define false 0
#define true 1
int Visited[MaxVertexNum]={false};
void DFS(MGraph Graph,int i)
{
	int j;
	Visited[i]=true;   //被访问的标记 
	printf("%d->",Graph->Data[i]);
	for(int j=0;j<Graph->Nv;j++)
	{
		if(Graph->G[i][j]==1&&!Visited[j])   //边(i,j)存在且j顶点未被访问，递归 
			DFS(Graph,j);
	} 
}
 
//深度优先遍历
void DFStraverse(MGraph Graph)
{
	for(int i=0;i<Graph->Nv;i++){
	if(!Visited[i])
			DFS(Graph,i);	
	}			
}

完整代码如下：

#include<stdio.h>
#include<stdlib.h>
#define MaxVertexNum 10
#define false 0
#define true 1
typedef int WeightType;
typedef int DataType;
typedef struct GNode *PtrToGNode;
int Visited[MaxVertexNum]={false};

struct GNode {
	int Nv;  //一张图的顶点数
	int Ne; //一张图的边数
	WeightType G[MaxVertexNum][MaxVertexNum];
	DataType Data[MaxVertexNum];//存顶点的数据
};
typedef PtrToGNode MGraph;//以邻接矩阵存储的图类型

//初始化一个有VertexNum 个顶点但没有边的图
typedef int Vertex;//用顶点下标表示顶点，为整型
MGraph CreateGraph(int VertexNum)
{
	Vertex V, W;
	MGraph Graph;
	
	Graph = (MGraph)malloc(sizeof(struct GNode));
	Graph->Nv = VertexNum;
	Graph->Ne = 0;
	
	//注意：这里默认顶点编号从0开始，到(Graph->Nv-1)
	for(V=0; V<Graph->Nv;V++)
		for(W=0; W<Graph->Nv;W++)
			Graph->G[V][W] = 0;
	for(int i =0;i<Graph->Nv;i++)
	{
		Visited[i]=false;
		Graph->Data[i]=i;
	}
	return Graph;
	
}
typedef struct ENode *PtrToENode;
struct ENode {
	Vertex V1,V2;//有向边<V1,V2>
	WeightType Weight;//权值
};
typedef PtrToENode Edge;

void InsertEdge(MGraph Graph, Edge E)
{
	Graph->G[E->V1][E->V2] = E->Weight;
	Graph->G[E->V2][E->V1] = E->Weight;
}


void DFS(MGraph Graph,int i)
{
	int j;
	Visited[i]=true;   //被访问的标记 
	printf("%d->",Graph->Data[i]);
	for(int j=0;j<Graph->Nv;j++)
	{
		if(Graph->G[i][j]==1&&!Visited[j])   //边(i,j)存在且j顶点未被访问，递归 
			DFS(Graph,j);
	} 
}
 
//深度优先遍历
void DFStraverse(MGraph Graph)
{
	for(int i=0;i<Graph->Nv;i++){
	if(!Visited[i])
			DFS(Graph,i);	
	}			
}
MGraph BuildGraph()
{
	
	MGraph Graph;
	Edge E;
	Vertex V;
	int Nv,i;
	scanf("%d",&Nv);
	Graph = CreateGraph(Nv);
	scanf("%d",&(Graph->Ne));
	if(Graph->Ne != 0) {
		E = (Edge)malloc(sizeof(struct ENode));
		for(i=0;i<Graph->Ne;i++) {
			scanf("%d %d %d",&E->V1,&E->V2,&E->Weight);
			InsertEdge(Graph, E);
		}
			
	}
	/*
	for(V=0;V<Graph->Nv;V++)
		scanf(" %c",&(Graph->Dadta[V]));
	*/
	return Graph;
}
int main()
{
	MGraph Graph = BuildGraph();
	int Nv = Graph->Nv;
	DFStraverse(Graph);
	return 0;
}