Ecosyste.ms: Awesome

An open API service indexing awesome lists of open source software.

Awesome Lists | Featured Topics | Projects

https://github.com/d-michail/jheaps

Master repository for the JHeaps project
https://github.com/d-michail/jheaps

algorithms data-structures fibonacci-heap heap meldable-heaps pairing-heap priority-queue

Last synced: 6 days ago
JSON representation

Master repository for the JHeaps project

Awesome Lists containing this project

README 

        
[![JHeaps](https://github.com/d-michail/jheaps/actions/workflows/master.yaml/badge.svg)](https://github.com/d-michail/jheaps/actions/workflows/master.yaml)



# JHeaps Library



Copyright (C) 2014-2021 Dimitrios Michail



Licensed under the Apache License, Version 2.0 (the "License");

you may not use this file except in compliance with the License.

You may obtain a copy of the License at



    http://www.apache.org/licenses/LICENSE-2.0



Unless required by applicable law or agreed to in writing, software

distributed under the License is distributed on an "AS IS" BASIS,

WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.

See the License for the specific language governing permissions and

limitations under the License.



***



## What is this library?



This library contains various heap implementations written in Java.



* It is easy to use

* The data structures have a well defined interface

* It is fast and well documented

* The heaps are written in a similar way as in the JDK

* It does not depend on other libraries, so classpathing 'jheaps.jar' is sufficient

  to use in your project.



## What is a heap?



A heap is a priority queue data type which contains elements with keys (duplicate keys

are permitted) from a totally-ordered universe. A min-oriented heap 

supports the following core operations: 



* MAKE-HEAP(): create an empty heap

* INSERT(H,x): insert an element x into the heap

* FIND-MIN(H): return an element with the smallest key

* EXTRACT-MIN(H): remove the element with the smallest key

* IS-EMPTY(H): is the heap empty?

* SIZE(H): return the number of elements of the heap

* CLEAR(H): remove all elements of the heap



A heap does not support a search operation. A special type of heap called explicit or 

addressable resolves this issue by returning a handle when inserting a new element. This

handle can later be used to additionally perform the following operations: 



* DECREASE-KEY(H,x,k): decrease the key of element x to k

* DELETE(H,x): delete the element x from the heap



Implicit heaps are represented using arrays. They are not addressable as the location of the elements

in memory can change. However, they can be made to be addressable by using an additional layer of indirection.

In this case we store handles inside the array. Each handle contains an additional integer property, designating

the location in the array where the handle is stored. 



Some heaps are meldable, that is they efficiently support the union operation: 



* MELD(H1,H2): add all elements of H2 into H1 and destroy H2



As a general rule, heaps using an array representation are not meldable.



## Available Heaps



The library contains an extensive collection of heap data structures such as:



* Tree-based

  * Fibonacci mergeable and addressable heaps

  * Simple Fibonacci heaps

  * Pairing mergeable and addressable heaps

  * Costless-meld variant of Pairing heaps

  * Rank-Pairing (type-1) mergeable and addressable heaps

  * Leftist mergeable and addressable heaps

  * Explicit binary tree addressable heaps

  * Binary tree soft heaps

  * Skew heaps

* Dag-based

  * Hollow mergeable and addressable heaps

* Double-ended mergeable and addressable heaps

  * Reflected Fibonacci heaps

  * Reflected Pairing heaps

* Array-based

  * Binary heaps

  * Binary addressable heaps

  * D-ary heaps

  * D-ary addressable heaps

  * Binary weak heaps

  * Binary weak heaps supporting bulk insertion

  * Highly optimized binary heaps for integer keys using the Wegener

   bottom-up heuristic and sentinel values

* Double-ended array-based

  * Binary MinMax heaps

* Monotone heaps

  * Addressable radix heaps with double, long, int or BigInteger keys

  * Non-addressable radix heaps with double, long, int or BigInteger keys



## Compatibility



The library requires JDK v1.8 and above. 



## Python Bindings



We also provide Python bindings which compile the Java library into a native shared library using

[GraalVM](https://www.graalvm.org/).

The result is a native self-contained library with no dependency on the JVM! For more information

see the following links:



* 

* 

* 

*