ConceptSystems & CS
Bitvector visited array optimization
An optimization for graph search algorithms that uses a compact bitvector to track visited nodes and reduce cache misses.
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
2The lectures that define it or assume it, and the concepts next to it.