邻接表实现图的创建

#include<stdio.h>
#include<stdlib.h>
#include "listGraph.cpp"

int main(void) {
    listGraph G;//定义保存邻接矩阵结构的图
    int i, j;

    printf("请输入生成图的类型(0.无向图, 1.有向图):");
    scanf("%d", &G.graphType);
    printf("请输入图的定点数量和边的数量:");
    scanf("%d %d", &G.vertexNum, &G.edgeNum);
    printf("输入构成各边的两个顶点及权值:
");
    createGraph(&G);//创建邻接表保存的图
    printf("邻接表数据如下:
");
    outList(&G);
    return 0;
}

void createGraph(listGraph* G) {
    int i, weight;
    int start, end;
    edgeNode* s;
    
    for (i = 1; i <= G->vertexNum; i++) G->adjList[i] = NULL;//将图中的各顶点指针清空
    for (i = 1; i <= G->edgeNum; i++) {
        getchar();
        printf("第%d条边:", i);
        scanf("%d %d %d", &start, &end, &weight);//输入边的起点和终点及权值
        s = (edgeNode*)malloc(sizeof(edgeNode));//申请保存一个顶点的内存
        s->next = G->adjList[start];//插入到邻接表中
        s->vertex = end;//保存终点编号
        s->weight = weight;
        G->adjList[start] = s;//邻接表对应顶点指向终点
        //如果是无向图，则需要再插入到终点的指针后
        if (!G->graphType) {
            s = (edgeNode*)malloc(sizeof(edgeNode));
            s->next = G->adjList[end];
            s->vertex = start;
            s->weight = weight;
            G->adjList[end] = s;    
        }
    }
}

void outList(listGraph* G) {
    int i;
    edgeNode* s;

    for (i = 1; i <= G->vertexNum; i++) {
        printf("顶点%d", i);
        s = G->adjList[i];
        while (s) {
            printf("->%d(%d)", s->vertex, s->weight);
            s = s->next;
        }
        printf("
");
    }
}

#include "listGraph.cpp" 如下：

#define vertex_max 20
typedef struct Node {
    int vertex;//定点序号
    int weight;//权值
    struct Node* next;//指向有边的下一个顶点
}edgeNode;

typedef struct {
    edgeNode* adjList[vertex_max];//指向每个顶点的指针
    int vertexNum, edgeNum;
    int graphType;//0表示无向图，1有向图
}listGraph;

void createGraph(listGraph* G);//生成图的邻接表
void outList(listGraph* G);//输出邻接表