本博文源于浙江大学《数据结构》。内容过于精彩,只能以代码表示。图的两种存储方式,一个是邻接矩阵,一个是邻接表。下面给出邻接表的操作及测试。博主想要创建一张图,是这样子的图
输出结果应该是这样子的:
0 1 3
1 2 0
2 1 3 4
3 0 2 5
4 2 5
5 4 3
附带结果:
下面表出源码
//图的邻接表创建
#include<stdio.h>
#include<stdlib.h>
#define MaxVertexNum 10
typedef int Vertex;
typedef int WeightType;
typedef char DataType;
typedef struct ENode *PtrToENode;
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;
}
int main()
{
LGraph Graph = BuildGraph();
int Nv = Graph->Nv;
printf("\n\n\n\n-----List Traverse---------\n\n\n\n");
for(int i =0;i<Nv;i++)
{
PtrToAdjVNode NewNode;
NewNode = (PtrToAdjVNode)malloc(sizeof(struct AdjVNode));
NewNode->Next = Graph->G[i].FirstEdge;
printf("%d ",Graph->G[i].Data);
NewNode = NewNode->Next;
while(NewNode != NULL)
{
printf("%d ",NewNode->AdjV);
NewNode = NewNode->Next;
}
printf("\n");
}
return 0;
}