Multiple choice:The following statement is wrong.
The following statement is wrong@[ B](2)
A. When the adjacency matrix method is used to store graphs, the storage space is only related to the number of vertices, but not to the number of edges.
B. Adjacency table method can only be used for the storage of digraph, while adjacency matrix method is suitable for both digraph and undirected graph.
C. The adjacency matrix of an undirected graph is symmetric, so only the lower (or upper) triangular part of the adjacency matrix can be stored.
D. For an undirected graph with n vertices and e edges, if adjacency representation is used, the size of the header vector is n.
A. When the adjacency matrix method is used to store graphs, the storage space is only related to the number of vertices, but not to the number of edges.
B. Adjacency table method can only be used for the storage of digraph, while adjacency matrix method is suitable for both digraph and undirected graph.
C. The adjacency matrix of an undirected graph is symmetric, so only the lower (or upper) triangular part of the adjacency matrix can be stored.
D. For an undirected graph with n vertices and e edges, if adjacency representation is used, the size of the header vector is n.
answer：B
A. When the adjacency matrix method is used to store graphs, the storage space is only related to the number of vertices, but not to the number of edges.
B. Adjacency table method can only be used for the storage of digraph, while adjacency matrix method is suitable for both digraph and undirected graph.
C. The adjacency matrix of an undirected graph is symmetric, so only the lower (or upper) triangular part of the adjacency matrix can be stored.
D. For an undirected graph with n vertices and e edges, if adjacency representation is used, the size of the header vector is n.
A. When the adjacency matrix method is used to store graphs, the storage space is only related to the number of vertices, but not to the number of edges.
B. Adjacency table method can only be used for the storage of digraph, while adjacency matrix method is suitable for both digraph and undirected graph.
C. The adjacency matrix of an undirected graph is symmetric, so only the lower (or upper) triangular part of the adjacency matrix can be stored.
D. For an undirected graph with n vertices and e edges, if adjacency representation is used, the size of the header vector is n.
answer：B
