Course contentsShow
← Mathematics
Lesson 2658 of 3,12153. Graph TheoryFree lesson

Circuits and Cycles

Define circuits and cycles; distinguish between closed walks and simple cycles in graph structures.

Circuits and Cycles

What you'll learn: You'll discover the difference between circuits (closed walks) and cycles (simple closed paths) in graph structures.

The Core Idea

In graph theory, we often want to describe journeys that return to where they started. A circuit is any closed walk—a path that begins and ends at the same vertex, potentially repeating edges or vertices along the way. A cycle, however, is a simple circuit: it's a closed path that visits no vertex (except the starting/ending one) more than once.

Think of it like this: imagine walking through your neighborhood. A circuit is any route that brings you home—you might pass the same corner twice or walk down the same street multiple times. A cycle is a more elegant loop: you return home without retracing your steps or revisiting any locations along the way.

Distinguishing the Two

Circuit (Closed Walk):

  • Starts and ends at the same vertex
  • May repeat vertices and edges
  • Example: v₁ → v₂ → v₃ → v₂ → v₁ (vertex v₂ is visited twice)

Cycle (Simple Circuit):

  • Starts and ends at the same vertex
  • No repeated vertices except the start/end
  • No repeated edges
  • Example: v₁ → v₂ → v₃ → v₁ (a triangle)

Every cycle is a circuit, but not every circuit is a cycle—just like every square is a rectangle, but not every rectangle is a square.

Why It Matters

Cycles are fundamental structures in graphs. They help identify circular dependencies in networks, detect loops in algorithms, and understand connectivity. Circuits, being more general, capture any closed journey in a graph, useful for analyzing routes that may revisit locations.

Key Takeaway: A circuit is any closed walk returning to its start; a cycle is a circuit that visits each vertex (except the first/last) exactly once—it's the "simplest" kind of closed path.