src/main/java/de/dfki/lt/loot/jada/FibonacciHeapBase.java
public HeapNode<Data> minimum() {
    if (rootWithMinKey == null)
      throw new EmptyHeapException("no minimum element, heap is empty");
    return rootWithMinKey;
  }
/** Return the HeapNode with the currently minimal key. It is possible that
   *  the heap contains multiple elements with equal minimal key, in this case,
   *  which node is returned is not determined.
   */
Return the HeapNode with the currently minimal key. It is possible that
the heap contains multiple elements with equal minimal key, in this case,
which node is returned is not determined.
Return the HeapNode with the currently minimal key . It is possible that the heap contains multiple elements with equal minimal key in this case which node is returned is not determined .
public HeapNode<Data> minimum() {
    if (rootWithMinKey == null)
      throw new EmptyHeapException("no minimum element, heap is empty");
    return rootWithMinKey;
  }
public HeapNode < Data > minimum ( ) { if ( rootWithMinKey == null ) throw new EmptyHeapException ( "no minimum element, heap is empty" ) ; return rootWithMinKey ; }
Return the HeapNode with the currently minimal key.
Return the HeapNode with the currently minimal key .