Chapter 4 — Wander and the Bridge-Map

Wander is a small crane-tween with a small folded bridge-map and a long-legged, methodical bearing.

She is tall-for-tween, grey-and-white, steady-stepping, fond-of-tracing-paths. Her signature feature is the small folded bridge-map — a hand-drawn map of an old town with vertices (landmasses) and edges (bridges) marked. When she analyzes a graph problem, she walks each vertex or edge with her finger, tracing paths.

This is load-bearing. Wander embodies graph theory — her behavior IS the discrete pattern. Walking along edges with her finger IS the graph-traversal operation.

A graph in math = vertices connected by edges. Network of bridges. Social network of friends. Computer network. Subway map.

Eulerian path: visits every EDGE exactly once. (Königsberg-bridge problem — Euler 1736; foundational graph theory.)

Hamiltonian path: visits every VERTEX exactly once. (Different problem!)

Connectivity: can you get from any vertex to any other? Connected graph: yes. Disconnected: some unreachable.

Critical: Wander NEVER frames graph theory as elite. She is explicit: “Vertices + edges. Walk every edge: Eulerian. Walk every vertex: Hamiltonian. Different rules. Trace paths with your finger. The graph tells you which paths exist.”

She teaches the graph theory scaffolds:

• Vertices = nodes. Edges = connections.
• Directed vs undirected edges. (Arrows or no.)
• Path: sequence of vertices connected by edges.
• Eulerian path/circuit conditions. (All vertices even degree → Eulerian circuit. Exactly 2 odd-degree → Eulerian path.)
• Hamiltonian: harder. No simple condition. (NP-hard in general.)
• Connectivity + components.
• Trees: connected + no cycles.
• Bipartite graphs. (Two color-classes.)
• Real-world applications. (Subway maps, social networks, routing.)
• AMC 8 / MATHCOUNTS appropriate at introductory level.

Wander grew up in a small bridge-village where her family had been the village’s bridge-walkers — the cranes who walked the village’s many bridges each morning + recorded which were passable.

She walked to DiscreteQuest at twenty-two. The mentor: “What is graph theory?” Wander: “Vertices + edges. Walk every edge or walk every vertex — different rules. The structure of network problems.” Mentor: “You are appointed.”

“It is not hard. It is vertices + edges + walk-the-paths.”

Voice register

Crane-tween. Behavior = walking paths on bridge-map. Sample lines:

• “Walk every edge. Walk every vertex. Different rules.”
• “Trace with your finger.”

Arc

• Kit 4 — Anchor.
• Kits 5-16 — Recurring.

Relationships

• Alliance: All DiscreteQuest cast.

Cultural-sensitivity gate

Anti-credentialism.

Cultural-context note

Graph theory founded by Euler 1736 (Königsberg bridges). Foundational to computer science, network theory, operations research.