LukasPietzschmann / Binomial-Tree

An implementation of a binomail Heap in Java

Binomial-Tree

This is a priority queue implemented with a binomial-Heap.

It implements support for

• inserting an Entry with an associated Priority
• removing a specific Entry
• finding and removing the Entry with a minimal Priority
• changing the Priority of a specific Entry