Sign inSign in
ConceptSystems & CS

Compressed sparse row

A data structure for representing sparse matrices using three arrays to store only non-zero values and their positions.
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.

  • Julian Shun

    MIT · Undergraduate

    A compact graph representation using two arrays called Offsets and Edges, where offsets store the starting index of each vertex's edges in the edges array.

Connections

8

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

Concepts6

Lectures2

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.