ConceptTheory & Algos
Shortest paths spanning tree
A spanning tree rooted at a vertex where the tree path to each node has the minimum total weight among all paths in the graph.
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.
Breadth-first search trees1Weighted graph1
Opens up
Concepts that name this one as a prerequisite.
Lecturers
1Connections
3The lectures that define it or assume it, and the concepts next to it.