Linked from

The 11 pages that link to Adjacency list, each with the reason it gives.

• Adjacency matrixCompared with: It avoids allocating entries for nonedges, unlike a full adjacency matrix.

• Ordered pairRelated: Directed graph edges can be recorded as ordered pairs of vertices.

• Breadth-first searchRelated: The algorithm scans each vertex’s listed neighbors as it expands the frontier.

• Depth-first searchRelated: DFS commonly scans each vertex's adjacency list to find its next unexplored neighbor.

• Dijkstra's algorithmRelated: Scanning each processed vertex's neighbors supports efficient edge relaxation.

• Topological sortingRelated: It supports efficient scans of outgoing edges during common sorting algorithms.

• Data structureBroader topic: Adjacency lists store sparse graphs compactly and support neighbor traversal.

• Dependency graphRelated: It is a common way to store each component's direct dependencies.

• Undirected graphRelated: Each vertex’s list records the other endpoint of every incident edge.

• Linked listRelated: Linked lists can store neighbor collections, especially when graph degrees vary.

• Prim's algorithmRelated: It lets implementations inspect edges leaving each newly added vertex.