src/main/java/de/dfki/lt/loot/jada/FibonacciHeap.java
public void decreaseKey(HeapNode<Key, Data> node, Key newKey) {
    Pair<Key, Data> old = node.data;
    if (newKey.compareTo(old.getFirst()) >= 0)
      throw new IllegalArgumentException("Trying to decrease key "
          + "to a greater key");
    old.setFirst(newKey);
    super.decreaseKey(node);
  }
/** Decrease the key of the HeapNode node to newKey.
   *  The new key must be strictly smaller than the old one, otherwise, an
   *  IllegalArgumentException will be thrown.
   */
Decrease the key of the HeapNode node to newKey.
The new key must be strictly smaller than the old one, otherwise, an
IllegalArgumentException will be thrown.
Decrease the key of the HeapNode node to newKey . The new key must be strictly smaller than the old one otherwise an IllegalArgumentException will be thrown .
public void decreaseKey(HeapNode<Key, Data> node, Key newKey) {
    Pair<Key, Data> old = node.data;
    if (newKey.compareTo(old.getFirst()) >= 0)
      throw new IllegalArgumentException("Trying to decrease key "
          + "to a greater key");
    old.setFirst(newKey);
    super.decreaseKey(node);
  }
public void decreaseKey ( HeapNode < Key , Data > node , Key newKey ) { Pair < Key , Data > old = node . data ; if ( newKey . compareTo ( old . getFirst ( ) ) >= 0 ) throw new IllegalArgumentException ( "Trying to decrease key " + "to a greater key" ) ; old . setFirst ( newKey ) ; super . decreaseKey ( node ) ; }
Decrease the key of the HeapNode node to newKey.
Decrease the key of the HeapNode node to newKey .