图的建立_codesailor-CSDN博客

本文链接：https://blog.csdn.net/dididisailor/article/details/50359539

#include <stdio.h>
#include <stdlib.h>
#define MAXVEX 20
typedef char VertexType;
typedef int EdgeType;
typedef struct EdgeNode{
    int  adjvex;
    //    EdgeType weight;//权值
    struct EdgeNode * next;
}EdgeNode;
typedef struct VertexNode{
    VertexType data;
    EdgeNode *firstedge;
}VertexNode,AdjList[MAXVEX];
typedef struct {
    AdjList adjList;
    int numVertexes,numEdges;
}GraphAdjList;
void CreateALGraph(GraphAdjList * G)
{
    printf("请输入顶点数和边数,如(2,3):\n");
    scanf("%d,%d",&G->numVertexes,&G->numEdges);

    getchar();
    for (int i=0; i<G->numVertexes; ++i) {

        printf("请输入顶点\n");
        scanf("%c",&G->adjList[i].data);///
        getchar();

        G->adjList[i].firstedge=NULL;

    }
    int i,j;
    EdgeNode *e;
    for (int k=0; k<G->numEdges; ++k) {
        printf("输入边(vi,vj)上的顶点序号，如(0,1):\n");
        scanf("%d,%d",&i,&j);
        e=(EdgeNode *)malloc(sizeof(EdgeNode));
        e->adjvex=j;
        e->next=G->adjList[i].firstedge;
        G->adjList[i].firstedge=e;
        e=(EdgeNode *)malloc(sizeof(EdgeNode));
        e->adjvex=i;
        e->next=G->adjList[j].firstedge;
        G->adjList[j].firstedge=e;
    }
}
int main()
{
    GraphAdjList * G;
    CreateALGraph(G);
    for (int i=0; i<G->numVertexes; ++i) {
        printf("%d->",i);
        while (G->adjList[i].firstedge!=NULL) {
            printf("%d->",G->adjList[i].firstedge->adjvex);
            G->adjList[i].firstedge=G->adjList[i].firstedge->next;
        }
        printf("\n");
    }
}