Sign inSign in

Euler tour

A walk that traverses every edge exactly once and starts and finishes at the same vertex.
Watch it explained

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.

Edge1Graph1Graph theory1Graph traversal1Tree data structure1Vertex1Walk1

Opens up

Concepts that name this one as a prerequisite.

Lecturers

2

Each in their own terms, from the easiest level.

  • Erik Demaine

    MIT · Graduate

    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

1

Connections

7

The lectures that define it or assume it, and the concepts next to it.

Concepts4

Lectures3

2 lecturers. Definitions are written by AI from each lecture’s transcript. A time with a play mark starts the lecture at the moment the lecturer says it.