ConceptTheory & Algos
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.
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
3Each in their own terms, from the easiest level.
Tom Leighton
A subgraph of a graph that is a tree and covers all the vertices of the original graph.Amartya Shankha Biswas
A tree that connects all the vertices of a graph together with the minimum number of edges.
Lectures that assume it
5Connections
17The lectures that define it or assume it, and the concepts next to it.