Which concept is defined as follows: a way of representing a graph where each vertex stores a list of its neighboring vertices?
- A. Skip list
- B. Linear probing
- C. Hash collision
- D. Adjacency list ✓
Correct answer
D. Adjacency list
Explanation
Adjacency list refers to a way of representing a graph where each vertex stores a list of its neighboring vertices.