Adjacency list

How it is used

Common in graph algorithms and memory-conscious implementations. It works well for sparse graphs where most node pairs are not connected.

Example sentences

1. We switched from a matrix to an adjacency list because the route graph had thousands of cities but relatively few direct connections.

   Here the term refers to a more space-efficient graph representation for sparse connections, where storing every possible pair is wasteful.

2. During the interview, she implemented breadth-first search using an adjacency list so neighbors could be visited without scanning empty cells.

   In this example, the list structure makes neighbor traversal direct, which suits graph searches better than checking a full matrix.

Common collocations

• store a graph as an adjacency list
• adjacency list representation
• build an adjacency list
• adjacency list implementation

Related terms

• algorithmA clear, step-by-step method for solving a problem or doing a task, such as sorting a list or finding the shortest route between two points.
• data structureA way of organizing data in memory, such as an array, list, tree or hash map, so that certain operations are fast and simple.

More terms: Data Structures and Algorithms

• array
• iterate
• hash map
• recursion
• Big O notation
• time complexity
• index
• sort
• stack
• queue
• linked list
• tree