Sign inSign in

Dynamic programming with Implicit graphs

Solving a graph problem using recursion and memoization or iteration over a grid without explicitly building the graph structure in memory.
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.

Memoization1Shortest paths in DAGs1Topological sort1

Lecturers

1

    Connections

    3

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

    Concepts2

    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.