Skip to content

HTTPS clone URL

Subversion checkout URL

You can clone with
or
.
Download ZIP

Loading…

Replace Priority Queue with Heap Implementation #1

Closed
rcythr opened this Issue · 0 comments

1 participant

@rcythr
Owner

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
@rcythr rcythr referenced this issue from a commit
@rcythr Fixed minor recursion bug in binary min heap (derp). Switched priorit…
…y implementations over to binary min heap. Fixes issue #1
81e8b7d
@rcythr rcythr closed this
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Something went wrong with that request. Please try again.