@Override public String toString(){
  if (minNode == null) {
    return "FibonacciHeap=[]";
  }
  Stack<FibonacciHeapNode<T>> stack=new Stack<FibonacciHeapNode<T>>();
  stack.push(minNode);
  StringBuffer buf=new StringBuffer(512);
  buf.append("FibonacciHeap=[");
  while (!stack.empty()) {
    FibonacciHeapNode<T> curr=stack.pop();
    buf.append(curr);
    buf.append(", ");
    if (curr.child != null) {
      stack.push(curr.child);
    }
    FibonacciHeapNode<T> start=curr;
    curr=curr.right;
    while (curr != start) {
      buf.append(curr);
      buf.append(", ");
      if (curr.child != null) {
        stack.push(curr.child);
      }
      curr=curr.right;
    }
  }
  buf.append(']');
  return buf.toString();
}

@ Override public String toString ( ) { if ( minNode == null ) { return "FibonacciHeap=[]" ; } Stack < FibonacciHeapNode < T > > stack = new Stack < FibonacciHeapNode < T > > ( ) ; stack . push ( minNode ) ; StringBuffer buf = new StringBuffer ( 512 ) ; buf . append ( "FibonacciHeap=[" ) ; while ( ! stack . empty ( ) ) { FibonacciHeapNode < T > curr = stack . pop ( ) ; buf . append ( curr ) ; buf . append ( ", " ) ; if ( curr . child != null ) { stack . push ( curr . child ) ; } FibonacciHeapNode < T > start = curr ; curr = curr . right ; while ( curr != start ) { buf . append ( curr ) ; buf . append ( ", " ) ; if ( curr . child != null ) { stack . push ( curr . child ) ; } curr = curr . right ; } } buf . append ( ']' ) ; return buf . toString ( ) ; }
creates a string representation of this fibonacci heap .
