ConceptTheory & Algos
Euler tour
A walk that traverses every edge exactly once and starts and finishes at the same vertex.
Know first
Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.
Opens up
Concepts that name this one as a prerequisite.
Lecturers
2Each in their own terms, from the easiest level.
Erik Demaine
A tour that visits every edge of a graph twice, which when applied to trees and recording depths yields an array representation useful for LCA reduction.
Lectures that assume it
1Connections
7The lectures that define it or assume it, and the concepts next to it.