Replace Priority Queue with Heap Implementation #1

rcythr opened this Issue Mar 10, 2014 · 0 comments


None yet

1 participant

rcythr commented Mar 10, 2014

The current priority queue inserts elements in O(n) time worst case. It would be much better to use a heap here instead.

@rcythr rcythr added the enhancement label Mar 10, 2014
@rcythr rcythr added a commit that referenced this issue Mar 13, 2014
@rcythr Fixed minor recursion bug in binary min heap (derp). Switched priorit…
…y implementations over to binary min heap. Fixes issue #1
@rcythr rcythr closed this Mar 13, 2014
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment