本博文源于浙江大学《数据结构》,主要完成了图的深度优先搜索(邻接表),根据姥姥课上讲解内容,一步步完成,深度优先搜索源码如下(文末完整代码):
我想对这样一个图进行遍历:
输入用例应该如下:
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
typedef struct ENode *PtrToENode;
int Visited[MaxVertexNum]={false};
void DFS(LGraph Graph, Vertex V)
{
PtrToAdjVNode W=Graph->G[V].FirstEdge;
printf("%d->",Graph->G[V].Data);
Visited[V]=true;
for(;W;W=W->Next)
if(!Visited[W->AdjV])
DFS(Graph,W->AdjV);
}
void DFStraverse(LGraph 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 Vertex;
typedef int WeightType;
typedef char DataType;
typedef struct ENode *PtrToENode;
int Visited[MaxVertexNum]={false};
struct ENode {
Vertex V1, V2;
WeightType Weight;
};
typedef PtrToENode Edge;
typedef struct AdjVNode *PtrToAdjVNode;
struct AdjVNode {
Vertex AdjV; // 邻接点的下标
WeightType Weight;//边的权重
PtrToAdjVNode Next;
};
typedef struct Vnode{
PtrToAdjVNode FirstEdge;
DataType Data;//存顶点得数据
}AdjList[MaxVertexNum];
typedef struct GNode *PtrToGNode;
struct GNode {
int Nv;//顶点数
int Ne;//边数
AdjList G;//邻接表
};
typedef PtrToGNode LGraph;
LGraph CreateGraph(int VertexNum)
{
Vertex 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;
Graph->G[V].Data = V;
}
return Graph;
}
void InsertEdge(LGraph Graph, Edge E)
{
PtrToAdjVNode NewNode;
NewNode = (PtrToAdjVNode)malloc(sizeof(struct AdjVNode));
NewNode->AdjV = E->V2;
NewNode->Weight = E->Weight;
//将v2插入v1的表头
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->Weight;
//将v2插入v1的表头
NewNode->Next = Graph->G[E->V2].FirstEdge;
Graph->G[E->V2].FirstEdge = NewNode;
}
LGraph BuildGraph()
{
LGraph Graph;
Edge E;
Vertex V;
int Nv,i;
scanf("%d",&Nv);//读入顶点个数
Graph = CreateGraph(Nv);//初始化有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);
}
}
return Graph;
}
void DFS(LGraph Graph, Vertex V)
{
PtrToAdjVNode W=Graph->G[V].FirstEdge;
printf("%d->",Graph->G[V].Data);
Visited[V]=true;
for(;W;W=W->Next)
if(!Visited[W->AdjV])
DFS(Graph,W->AdjV);
}
void DFStraverse(LGraph Graph)
{
for(int i=0;i<Graph->Nv;i++){
if(!Visited[i])
DFS(Graph,i);
}
}
int main()
{
LGraph Graph = BuildGraph();
int Nv = Graph->Nv;
DFStraverse(Graph);
return 0;
}