Replace map of neighbour cells with hash map (unordered_map)
Hashed maps are faster, O(1)
instead of O(log(n))
for all relevant operations (insert, search, delete).
Hashed maps are faster, O(1)
instead of O(log(n))
for all relevant operations (insert, search, delete).