Play DiscreteQuest

Wander the Bridge-Walker

GRAPH THEORY

A story read by Wander the Bridge-Walker

Loading audio…

Press play to listen along. The line being read lights up as you go.

Show full transcript

Loading transcript…

01 Opening
Wander the Bridge-Walker beat 1 of 5

Wander was a crane-tween. She was small for her age. But her legs were long. She moved with careful, steady steps. Her grey-and-white feathers were always neat. In her hand, she always carried a small, folded map. It was old and crinkled. It was her most important thing.

The map showed an old town. It had many landmasses. These were like little islands. Bridges connected them. Wander called the landmasses vertices. She called the bridges edges. When Wander thought about a problem, she used her map. She would trace paths with her finger. Her finger would walk along the edges. It would stop at the vertices. This was her way of doing things.

One sunny afternoon, a new student named Pip watched Wander. Pip was a squirrel-kit. He looked confused. Wander was tracing a path on her map.

"What are you doing?" Pip asked. He tilted his head.

Wander looked up. Her eyes were bright. "I am walking the graph," she said. She held out her map. "See? These are vertices. They are the land bits. And these are edges. They are the bridges."

02 Wander the Bridge-Walker
Wander the Bridge-Walker beat 2 of 5

Pip peered at the map. "So, like, a subway map?" he asked.

"Exactly!" Wander nodded. "Or friends on a playground. Or even computers talking. They are all graphs."

"What's a graph?" Pip asked.

"It's simple," Wander said. She tapped the map. "It's just vertices connected by edges. That's all."

"Oh," Pip said. He still looked a little lost.

"Sometimes," Wander continued, "you want to visit every bridge. You want to walk every single edge. But only once." She traced a winding path. Her finger moved slowly. "If you can do that, it's called an Eulerian path."

03 Wander the Bridge-Walker
Wander the Bridge-Walker beat 3 of 5

Pip frowned. "Why would I want to do that?"

"Maybe you're a bridge inspector," Wander said. "You need to check every bridge. But you don't want to walk the same bridge twice. That would waste time." She smiled. "My family did that."

"What if you want to visit every land bit?" Pip asked. "Every vertex?"

"Ah, that's different!" Wander said. Her finger moved again. This time, it jumped from landmass to landmass. It touched each vertex. "If you visit every vertex exactly once, that's a Hamiltonian path. Very different rules."

"So, Eulerian is about bridges," Pip said. "And Hamiltonian is about land?"

"You got it," Wander said. "Walk every edge: Eulerian. Walk every vertex: *Hamiltonian. Different rules for different problems."

04 Wander the Bridge-Walker
Wander the Bridge-Walker beat 4 of 5

Wander grew up in a place called Bridge-Village. It was a funny name. But it made perfect sense. Bridges stretched everywhere. They crisscrossed over rivers. They connected tiny islands. Her family were the village's bridge-walkers. They were cranes, just like Wander.

Every morning, they had an important job. They walked the village's many bridges. They checked each one. Was this bridge safe? Could that one hold a cart? They recorded everything. Young Wander learned this job early. She learned to trace paths. She learned to see connections.

She loved her map. It was a hand-drawn copy. It showed every bridge. It showed every landmass. She knew the village's network by heart. She knew which paths were open. She knew which paths were closed.

Sometimes, a bridge would break. Then a part of the village became cut off. "Can you get from this island to that one?" her father would ask. Wander would look at her map. She would trace with her finger. "No," she might say. "Not anymore. That bridge is out."

This was about connectivity. Can you get from any vertex to any other vertex? If you can't, the graph is disconnected. Some places are unreachable. Wander understood this deeply. She saw it every day.

When Wander was older, she heard about DiscreteQuest. It was a special school. She walked a long way to get there. The head mentor was a wise old owl. He looked at her carefully.

05 Closing
Wander the Bridge-Walker beat 5 of 5

"What is graph theory?" the mentor asked. His voice was deep.

Wander held out her map. "It's vertices and edges," she said. Her voice was clear. "You walk every edge, or you walk every vertex. They are different rules. It's how you solve network problems."

The mentor smiled. "You are appointed," he said.

Wander never thought these things were hard. She just saw them. She saw the paths. She saw the connections. "It's not hard," she always said. "It's just vertices and edges. And you walk the paths."

Sometimes, the edges had arrows. "That means you can only go one way," she would explain. "Like a one-way street. Those are directed edges." If there were no arrows, you could go both ways. Those were undirected edges.

She showed how a path was just a sequence of vertices. You moved from one to the next. You followed the edges. She showed how some graphs had no cycles. They were like trees. You could not go in a circle.

Wander helped anyone who asked. She made everything simple. She made it real. She used her map. She used her finger. She showed them the way.

Hear it as an audio drama

A short play starring Wander the Bridge-Walker, from DiscreteQuest. Different voices, same idea. Listen any time after you read.

Loading audio…

Read the drama script
  1. Narrator: From Spark and Anvil and DiscreteQuest — this is Wander The Bridge-Walker, in chapter 1 of the DiscreteQuest cast.
  2. Narrator: This drama uses an AI-generated voice. Voiced via Gemini 2.5.
  3. Narrator: Wander is a small crane-tween with a folded bridge-map. She is tall, grey and white, and always seems to be tracing paths with her finger.
  4. Narrator: Her map shows an old town. Tiny circles are the landmasses she calls vertices. The lines are the bridges she calls edges.
  5. Wander The Bridge-Walker: I am Wander the Bridge-Walker. The towns are vertices. The bridges are edges. It's how I understand the world.
  6. Narrator: This is the core of graph theory: understanding networks made of points and the lines that link them, like a subway map or the internet.
  7. Wander The Bridge-Walker: Sometimes, you must walk every *bridge* exactly once. That is an Eulerian path. My finger glides over each edge, careful not to repeat.
  8. Wander The Bridge-Walker: Other times, you must visit every *town* exactly once. A Hamiltonian path. That is a much trickier puzzle, with different rules for the journey.
  9. Narrator: Wander grew up in a village woven together by bridges. Her family were the bridge-walkers, checking each path every single morning.
  10. Wander The Bridge-Walker: I learned early. The world is just a series of connected points. The map tells you where you can go.
  11. Narrator: She walked to the DiscreteQuest academy at twenty-two. A wise mentor looked at her map and asked one question.
  12. Narrator: "What is graph theory?"
  13. Wander The Bridge-Walker: Vertices and edges. Walk every edge or walk every vertex. It is the structure of network problems, how everything connects.
  14. Narrator: The mentor nodded slowly. "You are appointed," she said.
  15. Wander The Bridge-Walker: It is not hard. It is just vertices and edges and walk-the-paths.
  16. Narrator: You've been listening to a Spark and Anvil chapter, written by the Spark and Anvil writing team for ages 9 to 14.
  17. Narrator: Apps stay free forever.
  18. Narrator: Curriculum aligned to AMC 8 math and Common Core.
  19. Narrator: Released under Creative Commons BY-NC-SA 4.0 for educational reuse. Visit Spark and Anvil for the full transcript.

The DiscreteQuest ensemble

Wander the Bridge-Walker is one of the friends in DiscreteQuest. Each friend shows you one idea by how they act; meet them all and you have the whole subject.

Kids also liked

Play NumberSense Play FractionForge Play IdentityForge Story Build · VentureQuest Story Build · CircuitForge Story What Am I · RiddleRealm