according to the paper, size increasing is a FIB-HEAP-INSERT operation

according to the paper, when performing a FIB-HEAP-INSERT, it increases the size but not the #of nodes

src/main/java/org/apache/commons/graph/collections/FibonacciHeap.java

@@ -117,10 +117,6 @@ public boolean add( E e )
 
         elementsIndex.add( e );
 
-        // n[H] <- n[H] + 1
-        size++;
-        trees++;
-
         return true;
     }
 
@@ -583,6 +579,9 @@ private void insert( FibonacciHeapNode<E> node )
                 minimumNode = node;
             }
         }
+
+        // n[H] <- n[H] + 1
+        size++;
     }
 
     /**