This repository has been archived on 2022-06-22. You can view files and clone it, but cannot push or open issues or pull requests.
usaco-guide/content/6_Plat/Eulerian_Tours.mdx
SamZhang3 ba0287a821
Update Eulerian_Tours.mdx
Fix problem links.
2020-06-27 22:01:51 -04:00

39 lines
1 KiB
Text

---
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
<problems-list problems={metadata.problems.sam} />
### Tutorial
- CPH (19, Path & Circuits)
### Problems
<problems-list problems={metadata.problems.general} />