图-邻接表

#include<iostream>
#include<stdlib.h>
using namespace std;

#define maxSize 100

typedef struct ArcNode
{
    int adjvex;
    struct ArcNode *nextarc;
}ArcNode;//边节点


typedef struct
{
    char data;
    ArcNode *firstarc;
}VNode;//第一列的起始节点


typedef struct
{
    VNode adjlist[maxSize];
    int n,e;
}AGraph;

int main()
{
    AGraph G;//(AGraph *)malloc(sizeof(AGraph));;
    for(int i=0;i<5;i++)
    {
        VNode v;//=(VNode *)malloc(sizeof(VNode));
        v.data=i;
        G.adjlist[i]=v;
    }


    G.adjlist[0].firstarc->adjvex=1;
    G.adjlist[0].firstarc->nextarc->adjvex=3;
    G.adjlist[0].firstarc->nextarc->nextarc->adjvex=4;
    G.adjlist[0].firstarc->nextarc->nextarc->nextarc=NULL;

    G.adjlist[1].firstarc->adjvex=4;
    G.adjlist[1].firstarc->nextarc->adjvex=2;
    G.adjlist[1].firstarc->nextarc->nextarc=NULL;

    G.adjlist[2].firstarc->adjvex=0;
    G.adjlist[1].firstarc->nextarc=NULL;

    G.adjlist[3].firstarc->adjvex=2;
    G.adjlist[1].firstarc->nextarc=NULL;

    G.adjlist[4].firstarc->nextarc=NULL;
}