Sign inSign in

Flow network

A directed graph with a source vertex and a sink vertex where each edge has a non-negative capacity.
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.

Directed graph2Capacity constraints1Graph theory1Graph theory basics1

Opens up

Concepts that name this one as a prerequisite.

Lecturers

1
  • Srini Devadas

    MIT · Undergraduate

    • 0:54Incremental Improvement: Matching

Lectures that assume it

1

Connections

9

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.