Sign inSign in

Adjacency list

A representation of a graph where each vertex stores a list of all vertices it is connected to by an edge.
as Erik Demaine defines itMITThe wording closest to all 5 definitions
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

4

Each in their own terms, from the easiest level.

  • Erik Demaine

    MIT · Undergraduate

    • 4:55Breadth-First Search (BFS)
  • Julian Shun

    MIT · Undergraduate

    A graph representation consisting of an array of pointers, one per vertex, where each pointer points to a linked list storing the edges for that vertex.
  • Victor Costan

    MIT · Undergraduate

    A dictionary where the keys are vertices and the values are lists of adjacent nodes.
    • 3:24Depth-First Search (DFS) (MIT 6.006, Recitation 14)
  • Jim Newton

    Griffin Financial Technology · Undergraduate

    A data structure that lets you walk through an arbitrary finite graph efficiently.
    • 8:33Teaching Functional Programming with Clojure in Academia: Insights and Challenges

Lectures that assume it

1

Connections

16

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

4 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.