The adjacency list supports finding all the vertices adjacent to a given vertex more efficiently than the adjacency matrix.

Name: The adjacency list supports finding all the vertices adjacent to a given vertex more efficiently than the adjacency matrix.
Brand: Quizplus
Rating: 4.7 (36 reviews)

Question

Quizplus · Accepted Answer

The adjacency list stores only the adjacent vertices for each vertex, whereas the adjacency matrix stores the entire graph, so searching an adjacency list for adjacent vertices is more efficient because it requires searching through fewer elements.

The Adjacency List Supports Finding All the Vertices Adjacent to a Given