You are viewing a plain text version of this content. The canonical link for it is here.
Posted to commits@commons.apache.org by si...@apache.org on 2012/07/11 12:27:31 UTC
svn commit: r1360104 -
/commons/sandbox/graph/trunk/src/main/java/org/apache/commons/graph/collections/FibonacciHeap.java
Author: simonetripodi
Date: Wed Jul 11 10:27:31 2012
New Revision: 1360104
URL: http://svn.apache.org/viewvc?rev=1360104&view=rev
Log:
dropped unnecessary empty lines, no functional modifications
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=1360104&r1=1360103&r2=1360104&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 Wed Jul 11 10:27:31 2012
@@ -486,14 +486,12 @@ public final class FibonacciHeap<E>
}
}
-
while ( numRoots > 0 )
{
// 5 d <- degree[x]
int degree = x.getDegree();
FibonacciHeapNode<E> next = x.getRight();
-
// 6 while A[d] != NIL
while ( nodeSequence.get( degree ) != null )
{
@@ -526,7 +524,6 @@ public final class FibonacciHeap<E>
numRoots--;
}
-
// 14 min[H] <- NIL
minimumNode = null;