You've learned to find shortest paths, minimum spanning trees, and maximum flows. Now I'll teach you Euler paths: traversing every edge of a graph exactly once.
I'll cover:
- When Euler paths and circuits exist
- Hierholzer's algorithm for finding them
- Applications like mail delivery and DNA sequencing
- De Bruijn sequences
Euler paths appear in routing problems, circuit design, and string reconstruction. By the end, you'll recognize these problems instantly.
