Author: simonetripodi
Date: Thu Jun 28 11:52:26 2012
New Revision: 1354957

URL: http://svn.apache.org/viewvc?rev=1354957&view=rev
Log:
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

Modified:
    
commons/sandbox/graph/trunk/src/main/java/org/apache/commons/graph/collections/FibonacciHeap.java

Modified: 
commons/sandbox/graph/trunk/src/main/java/org/apache/commons/graph/collections/FibonacciHeap.java
URL: 
http://svn.apache.org/viewvc/commons/sandbox/graph/trunk/src/main/java/org/apache/commons/graph/collections/FibonacciHeap.java?rev=1354957&r1=1354956&r2=1354957&view=diff
==============================================================================
--- 
commons/sandbox/graph/trunk/src/main/java/org/apache/commons/graph/collections/FibonacciHeap.java
 (original)
+++ 
commons/sandbox/graph/trunk/src/main/java/org/apache/commons/graph/collections/FibonacciHeap.java
 Thu Jun 28 11:52:26 2012
@@ -117,10 +117,6 @@ public final class FibonacciHeap<E>
 
         elementsIndex.add( e );
 
-        // n[H] <- n[H] + 1
-        size++;
-        trees++;
-
         return true;
     }
 
@@ -583,6 +579,9 @@ public final class FibonacciHeap<E>
                 minimumNode = node;
             }
         }
+
+        // n[H] <- n[H] + 1
+        size++;
     }
 
     /**


Reply via email to