1. Adjacency list. For every vertex, its adjacent vertices are stored. In the case of a weighted graph, the edge weights are stored along with the vertices.
確定! 回上一頁