This is a library of generic and efficient data structures written in TypeScript. Currently only one is provided.
This is a classic binary heap with O(lon(n)) insert, delete-min and decrease-key (assuming a min-heap). The comparison function is user-provided to support a min-heap or max-heap of arbitrary items.
Copyright (c) 2017- BusFaster Ltd