Bridge To Graphs And Computation

What This Chapter Built

This chapter introduced three core ideas:

• sets
• relations
• functions

Sets describe collections.

Relations describe connections.

Functions describe precise mappings.

These ideas give structure to objects, links, and transformations.

---

From Sets To Nodes

A set gives us a collection of things.

Example:

People = {Ada, Ben, Cleo}

In a graph, these things can become nodes.

Ada
Ben
Cleo

A graph starts with objects that can be treated as elements.

---

From Relations To Edges

A relation tells us which elements are connected.

Example:

knows = {(Ada, Ben), (Ben, Cleo)}

In a graph, those ordered pairs can become edges.

Ada -> Ben
Ben -> Cleo

A graph visualizes relation structure.

---

From Functions To Transformations

A function maps each input to exactly one output.

Example:

next(x)

could describe where each element goes next.

A -> B
B -> C
C -> C

This can also be represented as a graph, where each element points to its output.

Functions can be drawn as structured movement between nodes.

---

Why Graphs Come Next

Sets, relations, and functions are precise, but they can be hard to see when the structure grows.

Graphs make connection visible.

They help represent:

• paths
• cycles
• dependencies
• reachability
• branching structure

Graphs turn abstract relations into visible structure.

---

Bridge Summary

• Sets provide elements.
• Relations connect elements.
• Functions map elements.
• Graphs represent elements as nodes and connections as edges.
• Graphs make structure easier to inspect.
• The next chapter studies those graph structures directly.