Sign inSign in

Minimum spanning tree

Given a graph G and edge weights, a minimum spanning tree is a spanning tree of minimum total weight.
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.

Spanning tree2Edge-weighted graph1Graph1Graph edge weights1Tree1Vertex1Weighted graph1

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

    The spanning tree of an edge-weighted graph G with the smallest possible sum of edge weights.
    • 50:01Graph Theory II: Minimum Spanning Trees
  • Amartya Shankha Biswas

    MIT · Undergraduate

    A spanning tree of a graph whose edge weight sum is minimized.
    • 4:24Approximation Algorithms: Traveling Salesman Problem

Lectures that assume it

2

Connections

13

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.