Chapter 5: Euler Circuits: The Circuit Comes to Town
A successful student can...
- Identify and model Euler circuit and Euler path problems.
- Understand the meaning of basic graph terminology.
- Classify which graphs have Euler circuits or paths using Euler's circuit theorems.
- Implement Fleury's algorithm to find an Euler circuit or path when it exists.
- Eulerize and semi-eulerize graphs when necessary.
- Recognize an optimal eulerization (semi-eulerization) of a graph.
