Adjacency List

overview

Remember these Terms

• Adjacency list: For each vertex, store a list of neighbors.
• Vertex (node): A single point or item in the graph.
• Edge: A connection between two vertices; may be one-way.
• Neighbor: A vertex directly connected to a given vertex.
• Directed graph: All edges have direction from source to destination.
• Weighted edge: An edge with a cost, distance, or priority value.
• Space complexity: Adjacency lists need roughly O(V + E) memory.