图的邻接矩阵创建(无向图)

#include"stdio.h"

#define SIZE 10

typedef struct{
    int e_num;  //边数
    int v_num;  //顶点个数
    int links[SIZE][SIZE];   //邻接矩阵
    char vexs[SIZE];
}Graph;

void build(Graph *ph){
    printf("输入顶点个数：");
    scanf("%d",&ph->v_num);
    printf("输入边数：");
    scanf("%d",&ph->e_num);


    printf("顶点序列:");
    scanf("%s",&ph->vexs);

    for(int i=1; i<=ph->v_num; i++){
        for(int j=1; j<=ph->v_num; j++){
            ph->links[i][j] = 0;
        }
    }

    for(int j = 1; j<=ph->e_num; j++){
        int start,end,value;
        printf("第%d条边:",j);
        scanf("%d %d %d",&start,&end,&value);
        ph->links[start][end] = value;
        ph->links[end][start] = value;
    }

}

void show(Graph *ph){

    printf("顶点序列：\n");
    printf("%s",ph->vexs);
    printf("\n");
    
    printf("邻接矩阵：\n");
    for(int i=1; i<=ph->v_num; i++){
        for(int j=1; j<= ph->v_num; j++){
            printf("%2d",ph->links[i][j]);
        }
        printf("\n");
    }
    printf("\n");
}

int main(){
    Graph graph;
    build(&graph);
    show(&graph);
    return 0;
}