说明：  邻接矩阵存储的结构体中，包括一个存储边的结构体，存储每条边的信息(权值) 将这个边的结构体的二维数组作为图的基本存储结构，放到单个图的结构体中 每个图又包含总节点数、总边数、图的类型等信息
(The structure of adjacency matrix storage includes a structure of storing edges, which stores the information (weight) of each edge The two-dimensional array of the structure of this edge is taken as the basic storage structure of the graph and placed in the structure of a single graph Each graph also contains information such as the total number of nodes, the total number of edges, and the type of graph)