4.1(1) 图的存储结构-邻接矩阵-无权值
无向图 #include<stdio.h> #include<stdlib.h> #include<ctype.h> #include <string.h>typedef struct graph {int vertex[100];int edge[1000][1000];//顶点数int vn;//边的数目int en; }graph;void creategraph1(graph* pg) {graph g*pg;scanf(&quo…
2025-11-14