Author: simonetripodi
Date: Wed Jul 11 10:34:16 2012
New Revision: 1360111
URL: http://svn.apache.org/viewvc?rev=1360111&view=rev
Log:
use StringBuilder to create the heap representation rather than the StringBuffer
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=1360111&r1=1360110&r2=1360111&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:34:16 2012
@@ -708,8 +708,7 @@ public final class FibonacciHeap<E>
Stack<FibonacciHeapNode<E>> stack = new Stack<FibonacciHeapNode<E>>();
stack.push( minimumNode );
- StringBuffer buf = new StringBuffer( 512 );
- buf.append( "FibonacciHeap=[" );
+ StringBuilder buf = new StringBuilder( "FibonacciHeap=[" );
// do a simple breadth-first traversal on the tree
while ( !stack.empty() )