What is Adjacency list primarily used for?
- A. A way of representing a graph where each vertex stores a list of its neighboring vertices. ✓
- B. A probabilistic data structure that uses multiple layers of linked lists to allow fast search within an ordered sequence.
- C. An array-like data structure that automatically resizes itself as elements are added or removed.
- D. A collision resolution technique in hashing that searches sequentially for the next open slot in the table.
Correct answer
A. A way of representing a graph where each vertex stores a list of its neighboring vertices.
Explanation
Adjacency list refers to a way of representing a graph where each vertex stores a list of its neighboring vertices.