hed.h

数据结构里关于图的邻接矩阵的建立

typedef int InfoType;
#define MAXV 100

typedef struct 
{ int no;
InfoType info;
} VertexType;
typedef struct
{ int edges[MAXV][MAXV];
int vexnum,arcnum;
VertexType vexs[MAXV];
} MGraph;

typedef struct ANode
{ int adjvex;
struct ANode*nextarc;
} ArcNode;
typedef int Vertex;
typedef struct Vnode
{ Vertex data;
 ArcNode*firstarc;
} Vnode;
typedef Vnode Adjlist[MAXV];
typedef struct
{ Adjlist adjlist;
  int n,e;
} ALGraph;