Sign inSign in
ConceptSystems & CS

DAG

A directed acyclic graph represents the dependencies of expressions in the pipeline to enable parallelization.
as Marcel Kornacker defines itCarnegie Mellon University
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.

Opens up

Concepts that name this one as a prerequisite.

Lecturers

2

Each in their own terms, from the easiest level.

  • Erik Demaine

    MIT · Undergraduate

    A directed acyclic graph used to represent the dependencies between subproblems in dynamic programming.
    • 30:55Dynamic Programming IV: Guitar Fingering, Tetris, Super Mario Bros.

Lectures that assume it

6

Connections

15

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

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.