Author: simonetripodi
Date: Tue Jul 12 22:19:31 2011
New Revision: 1145796
URL: http://svn.apache.org/viewvc?rev=1145796&view=rev
Log:
added missing nodeSequence ArrayList initialization
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=1145796&r1=1145795&r2=1145796&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
Tue Jul 12 22:19:31 2011
@@ -19,9 +19,9 @@ package org.apache.commons.graph.collect
* under the License.
*/
-import static java.lang.Math.sqrt;
-import static java.lang.Math.log;
import static java.lang.Math.floor;
+import static java.lang.Math.log;
+import static java.lang.Math.sqrt;
import java.util.ArrayList;
import java.util.Collection;
@@ -320,8 +320,13 @@ public final class FibonacciHeap<E>
// -> D( n[H] ) = log( n[H] ) / log( phi )
int arraySize = ( (int) floor( log( size ) / LOG_PHI ) ) + 1;
- // A[i] <- NIL
- List<FibonacciHeapNode<E>> nodeSequence = new
ArrayList<FibonacciHeapNode<E>>(arraySize);
+ // for i <- 0 to D(n[H])
+ List<FibonacciHeapNode<E>> nodeSequence = new
ArrayList<FibonacciHeapNode<E>>( arraySize );
+ for ( int i = 0; i < arraySize; i++ )
+ {
+ // A[i] <- NIL
+ nodeSequence.add( i, null );
+ }
// for each node w in the root list of H
for ( FibonacciHeapNode<E> w = minimumNode.getRight(); w !=
minimumNode ; w = w.getRight() )
