Graphs

Small Graph Adjacency

Read a tiny graph adjacency list in node order. This is a small deterministic example, not solver engineering.

Example

Read a tiny graph adjacency list in node order. An adjacency list stores, for each node, the neighbors it connects to directly. Listing the nodes in a fixed order makes the graph's structure easy to scan and gives algorithms a predictable way to visit every edge, without the wasted space of a full connection table for a sparse graph.

highlighted = computed this step

Step 1 — Nodes

Set up the exact small combinatorics values.

nodes(A, B, C, D, E)\begin{array}{c|c}\text{nodes}&\text{(A, B, C, D, E)}\end{array}

Step 2 — Adjacency

Compute the highlighted combinatorics value.

adjacency((A, (B, C)), (B, (A, C, D)), (C, (A, B, D, E)), (D, (B, C, E)), (E, (C, D)))\begin{array}{c|c}\text{adjacency}&\hlmath{\text{((A, (B, C)), (B, (A, C, D)), (C, (A, B, D, E)), (D, (B, C, E)), (E, (C, D)))}}\end{array}
combinatorics-search Every row is intentionally ordered and pinned to the lesson specification.