逻辑结构分为两部分：V和E集合。因此，用一个一维数组存放图中所有顶点数据；用一个二维数组存放顶点间关系（边或弧）的数据，这个二维数组称为邻接矩阵。邻接矩阵又分为有向图邻接矩阵和无向图邻接矩阵(The logical structure is divided into two parts: the V and the E set. Therefore, a one-dimensional array is used to store all the vertex data in the graph, and a two-dimensional array is used to store the data of the vertex relations (edges or arcs). The two-dimensional array is called the adjacency matrix. Adjacency matrix is also divided into directed graph adjacency matrix and undirected graph adjacency matrix)