数据结构-邻接表的实现

#include
using namespace std;
#define max 100
typedef struct arcnode{
int adjvex;
struct arcnode* next;
}arcnode;
typedef struct vnode{
int data;
arcnode *firstnode;
}vnode,adjlist[max];
typedef struct {
adjlist vertices;
int vexnum,arcnum;
}graph;
void create(graph*m)
{
    int i,j,k,w;
    arcnode *e;
    cin>>m->vexnum>>m->arcnum;
    for(i=0;ivexnum;i++)
    {
        cin>>m->adjlist[i].data;
        g->adjlist[i].firstnode=NULL;
    }
    for(k=0;karcnum;++k)
    {
        cin>>i>>j;
        e=(arcnode*)malloc(sizeof(arcnode));
        e->adjvex=j;
        e->next=m->adjlist[i].firstnode;
        m->adjlist[i].firstnode=e;
    }
}
int main()
{
     graph m;
     create(&m);
    return 0;
}