Sign inSign in

Topological order

A linear ordering of vertices in a directed acyclic graph such that for every directed edge from u to v, u comes before v in the ordering.
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.

Lecturers

1
  • Erik Demaine

    MIT · Undergraduate

    • 1:05Dynamic Programming IV: Guitar Fingering, Tetris, Super Mario Bros.

Connections

3

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

1 lecturer. 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.