Sign inSign in

Spanning tree

A spanning tree of a graph G is a subset of edges of G that form a tree and hit all vertices of G.
as Erik Demaine defines itMITThe wording closest to all 3 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

3

Each in their own terms, from the easiest level.

  • Tom Leighton

    MIT · Undergraduate

    A subgraph of a graph that is a tree and covers all the vertices of the original graph.
    • 30:35Graph Theory II: Minimum Spanning Trees
  • Amartya Shankha Biswas

    MIT · Undergraduate

    A tree that connects all the vertices of a graph together with the minimum number of edges.
    • 10:13Approximation Algorithms: Traveling Salesman Problem

Lectures that assume it

5

Connections

17

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

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