svn commit: r1354950 - /commons/sandbox/graph/trunk/src/main/java/org/apache/commons/graph/collections/FibonacciHeap.java

[simonetripodi]

Author: simonetripodi
Date: Thu Jun 28 11:39:33 2012
New Revision: 1354950

URL: http://svn.apache.org/viewvc?rev=1354950&view=rev
Log:
add() method renamed to insert() to remind the FIB-HEAP-INSERT function as 
described in the paper

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=1354950&r1=1354949&r2=1354950&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:39:33 2012
@@ -120,7 +120,7 @@ public final class FibonacciHeap<E>
         // left[x] <- x
         // right[x] <- x
         // mark[x] <- FALSE
-        addNode( new FibonacciHeapNode<E>( e ) );
+        insert( new FibonacciHeapNode<E>( e ) );
 
         elementsIndex.add( e );
 
@@ -443,7 +443,7 @@ public final class FibonacciHeap<E>
             // if A[i] != NIL
             if ( pointer != null )
             {
-                addNode( pointer );
+                insert( pointer );
             }
         }
     }
@@ -555,7 +555,7 @@ public final class FibonacciHeap<E>
      * @see #offer(Object)
      * @see #add(Object)
      */
-    private void addNode( FibonacciHeapNode<E> node )
+    private void insert( FibonacciHeapNode<E> node )
     {
         // if min[H] = NIL
         if ( isEmpty() )