有向图的十字链表表存储表示

//---------有向图的十字链表表存储表示-------

#include<stdio.h>
#include<stdlib.h>

#define MAX_VERTEXT_NUM 20

typedef int InfoType;
typedef char VertextType;

typedef struct ArcBox
{
    int headVex;
    int tailVex;
    struct ArcBox *headLink;
    struct ArcBox *tailLink;
    InfoType *info;
}ArcBox;

typedef struct VexNode
{
    VertextType data;
    ArcBox *firstIn;
    ArcBox *firstOut;
}VexNode;

typedef struct
{
    VexNode xList[MAX_VERTEXT_NUM];
    int vexNum;
    int arcNum;
}OLGraph;

void CreateGraphic(OLGraph *G);
void DisplayGraphic(OLGraph *G);


int main()
{
    OLGraph *Graph = (OLGraph *)malloc(sizeof(OLGraph));
    CreateGraphic(Graph);
    DisplayGraphic(Graph);
    system("pause");
}

void CreateGraphic(OLGraph *G)
{
    int i,j,k;
    ArcBox *arcBox;
    printf_s("请输入顶点数和弧数：");
    scanf_s("%d,%d",&G->vexNum, &G->arcNum);

    //建立顶点表
    printf_s("建立顶点表
");
    for (i = 0; i < G->vexNum; i++)
    {
        printf_s("请输入第%d个顶点:", i);
        fflush(stdin);//刷新缓冲区

        G->xList[i].data = getchar();//输入顶点值
        G->xList [i].firstIn = NULL;//初始化指针
        G->xList[i].firstOut = NULL;//初始化指针
    }

    //建立弧表
    printf_s("建立弧表
");
    for (k = 0; k < G->arcNum; k++)
    {
        printf_s("请输入（headVex-tailVex）的顶点对序号");
        scanf_s("%d,%d", &i, &j);
        arcBox = (ArcBox *)malloc(sizeof(ArcBox));
        //对弧结点赋值
        arcBox->headVex = j;
        arcBox->tailVex = i;
        arcBox->headLink = G->xList[j].firstIn;
        arcBox->tailLink = G->xList[i].firstOut;
        arcBox->info = NULL;

        //完成在入弧和出弧链表表头的插入
        G->xList[j].firstIn = arcBox;
        G->xList[i].firstOut = arcBox;
    }
}

void DisplayGraphic(OLGraph *G)
{
    int i;
    ArcBox *arcBox;
    printf_s("共有%d个顶点，%d条弧
",G->vexNum, G->arcNum);

    for (i = 0; i < G->vexNum; i++)
    {
        printf_s("顶点%c:", G->xList[i].data);

        arcBox = G->xList[i].firstIn;
        printf_s("入度:");
        while (arcBox)
        {
            printf_s("%c->%c ", G->xList[arcBox->tailVex].data,G->xList[i].data);
            arcBox = arcBox->headLink;
        }

        arcBox = G->xList[i].firstOut;
        printf_s("出度:");
        while (arcBox)
        {
            printf_s("%c->%c ", G->xList[i].data,G->xList[arcBox->headVex].data);
            arcBox = arcBox->tailLink;
        }
        printf_s("
");
    }
}

请输入顶点数和弧数：4,7
建立顶点表
请输入第0个顶点:0
请输入第1个顶点:1
请输入第2个顶点:2
请输入第3个顶点:3
建立弧表
请输入（headVex-tailVex）的顶点对序号0,1
请输入（headVex-tailVex）的顶点对序号0,2
请输入（headVex-tailVex）的顶点对序号2,0
请输入（headVex-tailVex）的顶点对序号2,3
请输入（headVex-tailVex）的顶点对序号3,0
请输入（headVex-tailVex）的顶点对序号3,1
请输入（headVex-tailVex）的顶点对序号3,2
共有4个顶点，7条弧
顶点0:入度:3->0 2->0 出度:0->2 0->1
顶点1:入度:3->1 0->1 出度:
顶点2:入度:3->2 0->2 出度:2->3 2->0
顶点3:入度:2->3 出度:3->2 3->1 3->0
请按任意键继续. . .