图的存储结构

图的存储结构分为三种，一种是邻接矩阵，一种是邻接表，还有一种是邻接多重

//邻接矩阵
#define MAXSIZE 100

typedef struct
{
 int no;
 char info;
}VertexType;

typedef struct
{
 int edges[MAXSIZE][MAXSIZE];
 int n, e;
 VertexType vex[MAXSIZE];
};

//邻接表
#define MAXSIZE 100
typedef struct ArcNode
{
 int adjvex;
 struct ArcNode *nextarc;
 int info;
}ArcNode;

typedef struct VNode
{
 char data;
 ArcNode *firstarc;
}VNode;

typedef struct
{
 VNode adjlist[MAXSIZE];
 int n, e;
}AGraph;