25 lines
553 B
Text
25 lines
553 B
Text
---
|
|
id: eulerian-tours
|
|
title: "Eulerian Tours"
|
|
author: Benjamin Qi
|
|
prerequisites:
|
|
- Silver - Depth First Search
|
|
description: Visiting all edges of a graph exactly once.
|
|
---
|
|
|
|
Has not appeared on a recent USACO contest.
|
|
|
|
### Standard
|
|
|
|
- [Mail Delivery](https://cses.fi/problemset/task/1691)
|
|
- Undirected Euler Tour
|
|
- [Teleporters](https://cses.fi/problemset/task/1693)
|
|
- Directed Euler Tour
|
|
|
|
### Tutorial
|
|
|
|
- CPH (19, Path & Circuits)
|
|
|
|
### Problems
|
|
|
|
- [Matching Substrings](https://csacademy.com/contest/archive/task/matching-substrings/) [](87)
|