DSA · Theory

Adjacency List

Theory

800/810

Adjacency List

Adjacency List is a DSA topic. In plain words you use it for a short Adjacency List example in a short dry-run on paper. Don’t start with a slogan — start with that picture.

Smallest example: the smallest Adjacency List example you can type. Type it, run it, and say what you see. If you can do that from memory, you know Adjacency List.

From the example next to this theory: Adjacency List — graphs are often stored as adjacency lists: vertex → list of (neighbor, weight).

Trap — only saying “Adjacency List” with no example. Fix that before you talk about advanced DSA.

Viva — what is Adjacency List? Then show the smallest Adjacency List example you can type. Then name the trap.

Exam tip

What is Adjacency List? Show this: the smallest Adjacency List example you can type. Trap: only saying “Adjacency List” with no example.

Example

# adjacency list
graph = {
    "A": [("B", 2), ("C", 5)],
    "B": [("A", 2), ("C", 1)],
    "C": [("A", 5), ("B", 1)],
}
for u, edges in graph.items():
    print(u, "->", edges)

Adjacency List — graphs are often stored as adjacency lists: vertex → list of (neighbor, weight).

Short notes

DefAdjacency List — a short Adjacency List example in a short dry-run on paper.
Rulethe smallest Adjacency List example you can type
Traponly saying “Adjacency List” with no example
Usea short dry-run on paper

DSA · Theory

Adjacency List

← All stacks

Theory

800/810

Adjacency List

Adjacency List is a DSA topic. In plain words you use it for a short Adjacency List example in a short dry-run on paper. Don’t start with a slogan — start with that picture.

Smallest example: the smallest Adjacency List example you can type. Type it, run it, and say what you see. If you can do that from memory, you know Adjacency List.

From the example next to this theory: Adjacency List — graphs are often stored as adjacency lists: vertex → list of (neighbor, weight).

Trap — only saying “Adjacency List” with no example. Fix that before you talk about advanced DSA.

Viva — what is Adjacency List? Then show the smallest Adjacency List example you can type. Then name the trap.

Exam tip

What is Adjacency List? Show this: the smallest Adjacency List example you can type. Trap: only saying “Adjacency List” with no example.

Example

# adjacency list
graph = {
    "A": [("B", 2), ("C", 5)],
    "B": [("A", 2), ("C", 1)],
    "C": [("A", 5), ("B", 1)],
}
for u, edges in graph.items():
    print(u, "->", edges)

Adjacency List — graphs are often stored as adjacency lists: vertex → list of (neighbor, weight).

Short notes

DefAdjacency List — a short Adjacency List example in a short dry-run on paper.
Rulethe smallest Adjacency List example you can type
Traponly saying “Adjacency List” with no example
Usea short dry-run on paper

Adjacency List

Example

Short notes

Questions

Adjacency List

Example

Short notes

Questions