commons-commits mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From simonetrip...@apache.org
Subject svn commit: r1354963 - /commons/sandbox/graph/trunk/src/main/java/org/apache/commons/graph/collections/FibonacciHeap.java
Date Thu, 28 Jun 2012 12:07:01 GMT
Author: simonetripodi
Date: Thu Jun 28 12:07:00 2012
New Revision: 1354963

URL: http://svn.apache.org/viewvc?rev=1354963&view=rev
Log:
more embedded comments in insert() method

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=1354963&r1=1354962&r2=1354963&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 12:07:00 2012
@@ -571,7 +571,7 @@ public final class FibonacciHeap<E>
         // 6  mark[x] <- FALSE
         node.setMarked( false );
 
-        // if min[H] = NIL
+        // 8'  if min[H] = NIL
         if ( isEmpty() )
         {
             // then min[H] <- x
@@ -579,21 +579,21 @@ public final class FibonacciHeap<E>
         }
         else
         {
-            // concatenate the root list containing x with root list H
+            // 7 concatenate the root list containing x with root list H
             minimumNode.getLeft().setRight( node );
             node.setLeft( minimumNode.getLeft() );
             node.setRight( minimumNode );
             minimumNode.setLeft( node );
 
-            // if key[x] < key[min[H]]
+            // 8''  if key[x] < key[min[H]]
             if ( compare( node, minimumNode ) < 0 )
             {
-                // then min[H] <- x
+                // 9     then min[H] <- x
                 minimumNode = node;
             }
         }
 
-        // n[H] <- n[H] + 1
+        // 10  n[H] <- n[H] + 1
         size++;
     }
 



Mime
View raw message