Skip to content

Latest commit

 

History

History
8 lines (7 loc) · 280 Bytes

README.md

File metadata and controls

8 lines (7 loc) · 280 Bytes

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