ConceptTheory & Algos
Bottom tree connectivity query
An worst-case query using a bit vector of deleted edges and ancestor path bit vectors stored at each vertex.
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.