c语言创建矩阵,新手求教，关于图邻接矩阵的创建问题

该楼层疑似违规已被系统折叠 隐藏此楼查看此楼

#include

#define Maxi 10

typedef char vretex_type;//顶点数据类型

typedef int edge_type;//边的权值

typedef struct l_edge_node //链表边表结构定义

{

edge_type weight;

int xiabiao;

struct edge_node* next;

}L_edge_node;

typedef struct L_vertex_node//链表顶点结构

{

vretex_type data;

L_edge_node* firstedge;

}vertex_node,Adjlist[Maxi];

//typedef struct J_side_node//矩形边节点

//{

//int side[Maxi][Maxi];

//int weight;

//}J_side_node;

typedef struct J_graph//矩形图

{

int a[Maxi];

int side[Maxi][Maxi];

int munvertexs, munedge;

}J_graph,*P_J_graph;

typedef struct //图结构

{

Adjlist adjlist;

int munvertexs, munedge;

}GrphAdjList;

int J_graph_chuangjian(J_graph *g)//矩形图结构创建

{

int a = 0,i,j,x;

printf("请输入顶点数和边数：");

scanf_s("%d%d", &g->munvertexs, &g->munedge);

for (i = 0; i < g->munvertexs; i++)

{

printf("请输入顶点的值");

scanf_s("%d", &g->a[i]);

}

for(i=0;i

for (j = 0; j

{

g->side[i][j] = 88888;

}

for (int k = 1; k <= g->munedge; k++)

{

printf("请输入顶点(vi,vj)上的下标，和权值");

scanf_s("%d%d%d", &i, &j,&x);

g->side[i][j] = x;

g->side[i][j] = g->side[j][i];

}

return 1;

}

int main()

{

J_graph T;

J_graph_chuangjian(&T);

return 0;

}