Class SimpleFibonacciHeap<K,V>
- java.lang.Object
-
- org.jheaps.tree.SimpleFibonacciHeap<K,V>
-
- Type Parameters:
K
- the type of keys maintained by this heapV
- the type of values maintained by this heap
- All Implemented Interfaces:
java.io.Serializable
,AddressableHeap<K,V>
,MergeableAddressableHeap<K,V>
public class SimpleFibonacciHeap<K,V> extends java.lang.Object implements MergeableAddressableHeap<K,V>, java.io.Serializable
Simple Fibonacci heaps. The heap is sorted according to the natural ordering of its keys, or by aComparator
provided at heap creation time, depending on which constructor is used.This variant of the Fibonacci heaps is described in detail in the following paper:
- Haim Kaplan, Robert E. Tarjan, Uri Zwick, Fibonacci Heaps Revisited, arXiv 1407.5750, 2014.
This implementation provides amortized O(1) time for operations that do not involve deleting an element such as
insert
, anddecreaseKey
. OperationfindMin
is worst-case O(1). OperationsdeleteMin
anddelete
are amortized O(log(n)). The operationmeld
is also amortized O(1).All the above bounds, however, assume that the user does not perform cascading melds on heaps such as:
d.meld(e); c.meld(d); b.meld(c); a.meld(b);
The above scenario, although efficiently supported by using union-find with path compression, invalidates the claimed bounds.Note that the ordering maintained by this heap, like any heap, and whether or not an explicit comparator is provided, must be consistent with
equals
if this heap is to correctly implement theAddressableHeap
interface. (SeeComparable
orComparator
for a precise definition of consistent with equals.) This is so because theAddressableHeap
interface is defined in terms of theequals
operation, but this heap performs all key comparisons using itscompareTo
(orcompare
) method, so two keys that are deemed equal by this method are, from the standpoint of the Fibonacci heap, equal. The behavior of a heap is well-defined even if its ordering is inconsistent withequals
; it just fails to obey the general contract of theAddressableHeap
interface.Note that this implementation is not synchronized. If multiple threads access a heap concurrently, and at least one of the threads modifies the heap structurally, it must be synchronized externally. (A structural modification is any operation that adds or deletes one or more elements or changing the key of some element.) This is typically accomplished by synchronizing on some object that naturally encapsulates the heap.
- See Also:
- Serialized Form
-
-
Nested Class Summary
Nested Classes Modifier and Type Class Description (package private) static class
SimpleFibonacciHeap.Node<K,V>
-
Nested classes/interfaces inherited from interface org.jheaps.AddressableHeap
AddressableHeap.Handle<K,V>
-
-
Field Summary
Fields Modifier and Type Field Description private SimpleFibonacciHeap.Node<K,V>[]
aux
Auxiliary array for consolidationprivate static int
AUX_CONSOLIDATE_ARRAY_SIZE
Size of consolidation auxiliary array.private java.util.Comparator<? super K>
comparator
The comparator used to maintain order in this heap, or null if it uses the natural ordering of its keys.protected SimpleFibonacciHeap<K,V>
other
Used to reference the current heap or some other heap in case of melding, so that handles remain valid even after a meld, without having to iterate over them.private SimpleFibonacciHeap.Node<K,V>
root
The rootprivate static long
serialVersionUID
private long
size
Size of the heap
-
Constructor Summary
Constructors Constructor Description SimpleFibonacciHeap()
Constructs a new, empty heap, using the natural ordering of its keys.SimpleFibonacciHeap(java.util.Comparator<? super K> comparator)
Constructs a new, empty heap, ordered according to the given comparator.
-
Method Summary
All Methods Instance Methods Concrete Methods Modifier and Type Method Description private void
cascadingRankChange(SimpleFibonacciHeap.Node<K,V> y)
void
clear()
Clear all the elements of the heap.private void
comparableDecreaseKey(SimpleFibonacciHeap.Node<K,V> n, K newKey)
private AddressableHeap.Handle<K,V>
comparableDeleteMin()
java.util.Comparator<? super K>
comparator()
Returns the comparator used to order the keys in this AddressableHeap, ornull
if this heap uses the natural ordering of its keys.private void
comparatorDecreaseKey(SimpleFibonacciHeap.Node<K,V> n, K newKey)
private AddressableHeap.Handle<K,V>
comparatorDeleteMin()
private void
cut(SimpleFibonacciHeap.Node<K,V> x, SimpleFibonacciHeap.Node<K,V> y)
AddressableHeap.Handle<K,V>
deleteMin()
Delete and return an element with the minimum key.AddressableHeap.Handle<K,V>
findMin()
Find an element with the minimum key.private void
forceDecreaseKeyToMinimum(SimpleFibonacciHeap.Node<K,V> n)
AddressableHeap.Handle<K,V>
insert(K key)
Insert a new element into the heap with a null value.AddressableHeap.Handle<K,V>
insert(K key, V value)
Insert a new element into the heap.boolean
isEmpty()
Returnstrue
if this heap is empty.private SimpleFibonacciHeap.Node<K,V>
link(SimpleFibonacciHeap.Node<K,V> y, SimpleFibonacciHeap.Node<K,V> x)
void
meld(MergeableAddressableHeap<K,V> other)
Meld a heap into the current heap.long
size()
Returns the number of elements in the heap.
-
-
-
Field Detail
-
serialVersionUID
private static final long serialVersionUID
- See Also:
- Constant Field Values
-
AUX_CONSOLIDATE_ARRAY_SIZE
private static final int AUX_CONSOLIDATE_ARRAY_SIZE
Size of consolidation auxiliary array. Computed for number of elements equal toLong.MAX_VALUE
.- See Also:
- Constant Field Values
-
comparator
private final java.util.Comparator<? super K> comparator
The comparator used to maintain order in this heap, or null if it uses the natural ordering of its keys.
-
root
private SimpleFibonacciHeap.Node<K,V> root
The root
-
size
private long size
Size of the heap
-
aux
private SimpleFibonacciHeap.Node<K,V>[] aux
Auxiliary array for consolidation
-
other
protected SimpleFibonacciHeap<K,V> other
Used to reference the current heap or some other heap in case of melding, so that handles remain valid even after a meld, without having to iterate over them. In order to avoid maintaining a full-fledged union-find data structure, we disallow a heap to be used in melding more than once. We use however, path-compression in case of cascading melds, that it, a handle moves from one heap to another and then another.
-
-
Constructor Detail
-
SimpleFibonacciHeap
public SimpleFibonacciHeap()
Constructs a new, empty heap, using the natural ordering of its keys. All keys inserted into the heap must implement theComparable
interface. Furthermore, all such keys must be mutually comparable:k1.compareTo(k2)
must not throw aClassCastException
for any keysk1
andk2
in the heap. If the user attempts to put a key into the heap that violates this constraint (for example, the user attempts to put a string key into a heap whose keys are integers), theinsert(Object key)
call will throw aClassCastException
.
-
SimpleFibonacciHeap
public SimpleFibonacciHeap(java.util.Comparator<? super K> comparator)
Constructs a new, empty heap, ordered according to the given comparator. All keys inserted into the heap must be mutually comparable by the given comparator:comparator.compare(k1, k2)
must not throw aClassCastException
for any keysk1
andk2
in the heap. If the user attempts to put a key into the heap that violates this constraint, theinsert(Object key)
call will throw aClassCastException
.- Parameters:
comparator
- the comparator that will be used to order this heap. Ifnull
, the natural ordering of the keys will be used.
-
-
Method Detail
-
insert
public AddressableHeap.Handle<K,V> insert(K key, V value)
Insert a new element into the heap.- Specified by:
insert
in interfaceAddressableHeap<K,V>
- Parameters:
key
- the element's keyvalue
- the element's value- Returns:
- a handle for the newly added element
- Throws:
java.lang.IllegalStateException
- if the heap has already been used in the right hand side of a meld
-
insert
public AddressableHeap.Handle<K,V> insert(K key)
Insert a new element into the heap with a null value.- Specified by:
insert
in interfaceAddressableHeap<K,V>
- Parameters:
key
- the element's key- Returns:
- a handle for the newly added element
- Throws:
java.lang.IllegalStateException
- if the heap has already been used in the right hand side of a meld
-
findMin
public AddressableHeap.Handle<K,V> findMin()
Find an element with the minimum key.- Specified by:
findMin
in interfaceAddressableHeap<K,V>
- Returns:
- a handle to an element with minimum key
-
deleteMin
public AddressableHeap.Handle<K,V> deleteMin()
Delete and return an element with the minimum key. If multiple such elements exists, only one of them will be deleted. After the element is deleted the handle is invalidated and only methodAddressableHeap.Handle.getKey()
andAddressableHeap.Handle.getValue()
can be used.- Specified by:
deleteMin
in interfaceAddressableHeap<K,V>
- Returns:
- a handle to the deleted element with minimum key
-
isEmpty
public boolean isEmpty()
Returnstrue
if this heap is empty.- Specified by:
isEmpty
in interfaceAddressableHeap<K,V>
- Returns:
true
if this heap is empty,false
otherwise
-
size
public long size()
Returns the number of elements in the heap.- Specified by:
size
in interfaceAddressableHeap<K,V>
- Returns:
- the number of elements in the heap
-
comparator
public java.util.Comparator<? super K> comparator()
Returns the comparator used to order the keys in this AddressableHeap, ornull
if this heap uses the natural ordering of its keys.- Specified by:
comparator
in interfaceAddressableHeap<K,V>
- Returns:
- the comparator used to order the keys in this heap, or
null
if this addressable heap uses the natural ordering of its keys
-
clear
public void clear()
Clear all the elements of the heap. After calling this method all handles should be considered invalidated and the behavior of methodsAddressableHeap.Handle.decreaseKey(Object)
andAddressableHeap.Handle.delete()
is undefined.- Specified by:
clear
in interfaceAddressableHeap<K,V>
-
meld
public void meld(MergeableAddressableHeap<K,V> other)
Meld a heap into the current heap. After the operation theother
heap will be empty and will not permit further insertions.- Specified by:
meld
in interfaceMergeableAddressableHeap<K,V>
- Parameters:
other
- a merge-able heap
-
comparableDecreaseKey
private void comparableDecreaseKey(SimpleFibonacciHeap.Node<K,V> n, K newKey)
-
comparatorDecreaseKey
private void comparatorDecreaseKey(SimpleFibonacciHeap.Node<K,V> n, K newKey)
-
forceDecreaseKeyToMinimum
private void forceDecreaseKeyToMinimum(SimpleFibonacciHeap.Node<K,V> n)
-
comparableDeleteMin
private AddressableHeap.Handle<K,V> comparableDeleteMin()
-
comparatorDeleteMin
private AddressableHeap.Handle<K,V> comparatorDeleteMin()
-
link
private SimpleFibonacciHeap.Node<K,V> link(SimpleFibonacciHeap.Node<K,V> y, SimpleFibonacciHeap.Node<K,V> x)
-
cut
private void cut(SimpleFibonacciHeap.Node<K,V> x, SimpleFibonacciHeap.Node<K,V> y)
-
cascadingRankChange
private void cascadingRankChange(SimpleFibonacciHeap.Node<K,V> y)
-
-