[说明] 编写一个函数根据用户输入的偶对(以输入。表示结束)建立其有向图的邻接表。一个图的邻接表存储结构定义如下： # include ＜ stdio. h ＞ # define MAXVEX 30 struct edgenode int adjvex; char info; struct edgenode * next; struct vexnode char data; struct edgenode * link; typedef struct vexnode adjlist [MAXVEX]; 实现要求的函数如下: void creatadjlist ( adjlist g) int i, j, k; street vexnode * s; for( k=1; k＜ =n; k+ +) (1) g [k]. link = NULL; printf ( “输一个对：” ); scanf ("%d, %d", &i, &j); while (2) (3) s- ＞adjvex =j; (4) g [i].link =s; (5)