图邻接表的定义

#include<bits/stdc++.h>
#define maxSize 20
using namespace std;
char VName[5]={'A','B','C','D','E'};
int weight[5][5]={0,3,2,4,1,3,0,5,0,6,2,5,0,2,0,4,0,2,0,0,1,6,0,0,0};

typedef struct VNode
{
	int no;      //点的编号 
	char data;   //点的字母 
}VNode;

typedef struct MGraph
{
	int edgeW[maxSize][maxSize];
	int n , e;
	VNode vex[maxSize];
}MGraph;

void createGraph(MGraph *g)
{
	g->e = 7;
	g->n = 5;
	for(int i = 0 ; i < g->n ; i++)
	{
		g->vex[i].data = VName[i];
		g->vex[i].no = i;
	}
	for(int i = 0 ; i < g->n ; ++i)
	{
		for(int j = 0 ; j < g->n ; j++)
		{
			g->edgeW[i][j] = weight[i][j];
		}
	}
}
int main()
{
	MGraph *g;
	createGraph(g);
	return 0;
}