很简单,两部分。
图GNode包含:
1、二维矩阵G[][]
2、顶点数
3、边数
4、结点的数据(可选)
边ENode包含:
1、是那两个结点的边(边的位置)
2、边的权重weight
通过Insert函数把边ENode插入图GNode中。
//图的邻接矩阵表示法
#include <stdio.h>
#include <stdlib.h>
#define MaxVertexNum 100
#define Infinity 65535
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 GNode *PtrToGNode;
struct GNode{
int Nv;//顶点数
int Ne;//边数
WeightType G[MaxVertexNum][MaxVertexNum];
DataType Data[MaxVertexNum];
};
typedef PtrToGNode MGraph;
MGraph CreateGraph(int VertexNum)
{
Vertex V,W;
MGraph Graph;
Graph=(MGraph)malloc(sizeof(struct GNode));
Graph->Nv=VertexNum;
Graph->Ne=0;
for(V=0;V<Graph->Nv;V++){
for(W=0;W<Graph->Nv;W++)
Graph->G[V][W]=Infinity;
}
return Graph;
}
void InsertEdge(MGraph Graph, Edge E)
{
Graph->G[E->V1][E->V2]=E->Weight;
Graph->G[E->V2][E->V1]=E->Weight;
}
MGraph BuildGraph()
{
MGraph Graph;
Edge E;
Vertex V;
int Nv,i;
printf("请输入结点数:\n");
scanf("%d",&Nv);
Graph=CreateGraph(Nv);
printf("请输入边数:\n");
scanf("%d",&(Graph->Ne));
if(Graph->Ne!=0){
E=(Edge)malloc(sizeof(struct ENode));
for(i=0;i<Graph->Ne;i++){
printf("边ENode:\n");
scanf("%d %d %d",&E->V1,&E->V2,&E->Weight);
InsertEdge(Graph,E);
}
}
return Graph;
}
int main()
{
MGraph Graph=BuildGraph();
for(int j=0;j<5;j++){
for(int i=0;i<5;i++)
printf("%6d",Graph->G[j][i]);
printf("\n");
}
return 0;
}