---
id: eulerian-tours
title: "Eulerian Tours"
author: Benjamin Qi
prerequisites:
- Silver - Depth First Search
description: Visiting all edges of a graph exactly once.
frequency: 0
---
Has not appeared on a recent USACO contest.
import { Problem } from "../models";
export const metadata = {
problems: {
sam: [
new Problem("CSES", "Mail Delivery (Undirected)", "1691", "Easy", false, ["Euler Tour"], ""),
new Problem("CSES", "Teleporters (Directed)", "1693", "Easy", false, ["Euler Tour"], ""),
],
general: [
new Problem("CSA", "Matching Substrings", "matching-substrings", "Normal", false, [], ""),
new Problem("CF", "Johnny and Megan's Necklace", "contest/1361/problem/C", "Normal", false, ["Euler Tour"], ""),
new Problem("CF", "Data Center Drama", "contest/528/problem/C", "Normal", false, ["Euler Tour"], ""),
]
}
};
### Standard
### Tutorial
- CPH (19, Path & Circuits)
### Problems