邻接表的建立

//----有向图的邻接表示 
#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#define TRUE 1
#define FALSE 0
#define OK 1
#define ERROR 0
#define OVERFLOW 0
typedef int Status;
using namespace std;
typedef struct ArcNode{
	int adjex;
	int weight;
	struct ArcNode *nextarc;
	//InfoType *info;
}ArcNode; 
typedef struct VNode{
	char name;
	struct ArcNode *firstarc;
}VNode;
typedef struct ALGraph{
	char vexname[20];
	int vexnum,arcnum;
	struct VNode vertices[20];
}ALGraph;
Status CreateGraph(ALGraph &G){
	int i,num,weight;
	ArcNode *p,*r;
	char ch;
	scanf("%d",&G.vexnum);
	getchar();
	for(i=0;i<G.vexnum;i++)
		{
			ch=getchar();
			G.vexname[i]=ch;
			//printf("%c\n",G.vexname[i]);
			getchar();
		}
	for(i=0;i<G.vexnum;i++)
		{
		G.vertices[i].name=G.vexname[i];
		G.vertices[i].firstarc=(ArcNode*)malloc(sizeof(ArcNode));
		G.vertices[i].firstarc->nextarc=NULL; 
		}
	for(i=0;i<G.vexnum;i++)
		{scanf("%d",&num);
		p=G.vertices[i].firstarc;
		while(num!=-1){			
			r=(ArcNode*)malloc(sizeof(ArcNode));
			scanf("%d",&weight);
			r->adjex=num;
			r->weight=weight;
			r->nextarc=p->nextarc;
			p->nextarc=r;			
			scanf("%d",&num);	
		}; };
		return 0;
		
}
Status ShowGraph(ALGraph &G)
{
	ArcNode *p;
	int i;
	for(i=0;i<G.vexnum;i++)
	{
		printf("%c  ",G.vexname[i]);
		p=G.vertices[i].firstarc;
		p=p->nextarc;
		while(p!=NULL)
		{
			printf("(%d,%d)%d  ",i,p->adjex,p->weight);
			p=p->nextarc;
		}
	printf("\n");
	};
	return 0;
}
int main()
{
	ALGraph G;
	CreateGraph(G);
	ShowGraph(G);
	return 0;
}