araml/sparse_set
A sparse set is a data structure that allows (at the cost of double the memory for indexes) to do insertion deletion and lookup in O(1) while maintaining a O(n) traversal time where n is the amount of elements in the set.
C++
A sparse set is a data structure that allows (at the cost of double the memory for indexes) to do insertion deletion and lookup in O(1) while maintaining a O(n) traversal time where n is the amount of elements in the set.
C++