ConceptTheory & Algos
Optimized connectivity query via B-trees
Using -trees of branching factor for the top-level forest to speed up find root operations to O((log n)/(log log n)).
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.
Lecturers
1Connections
3The lectures that define it or assume it, and the concepts next to it.