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/02/02 22:17:22 UTC
svn commit: r1239852 -
/commons/sandbox/graph/trunk/src/test/java/org/apache/commons/graph/spanning/BoruvkaTestCase.java
Author: simonetripodi
Date: Thu Feb 2 21:17:22 2012
New Revision: 1239852
URL: http://svn.apache.org/viewvc?rev=1239852&view=rev
Log:
removed unused assignments
Modified:
commons/sandbox/graph/trunk/src/test/java/org/apache/commons/graph/spanning/BoruvkaTestCase.java
Modified: commons/sandbox/graph/trunk/src/test/java/org/apache/commons/graph/spanning/BoruvkaTestCase.java
URL: http://svn.apache.org/viewvc/commons/sandbox/graph/trunk/src/test/java/org/apache/commons/graph/spanning/BoruvkaTestCase.java?rev=1239852&r1=1239851&r2=1239852&view=diff
==============================================================================
--- commons/sandbox/graph/trunk/src/test/java/org/apache/commons/graph/spanning/BoruvkaTestCase.java (original)
+++ commons/sandbox/graph/trunk/src/test/java/org/apache/commons/graph/spanning/BoruvkaTestCase.java Thu Feb 2 21:17:22 2012
@@ -109,21 +109,13 @@ public final class BoruvkaTestCase
UndirectedMutableWeightedGraph<BaseLabeledVertex, BaseLabeledWeightedEdge<Double>, Double> input =
new UndirectedMutableWeightedGraph<BaseLabeledVertex, BaseLabeledWeightedEdge<Double>, Double>();
- BaseLabeledVertex a = new BaseLabeledVertex( "A" );
- BaseLabeledVertex b = new BaseLabeledVertex( "B" );
- BaseLabeledVertex c = new BaseLabeledVertex( "C" );
- BaseLabeledVertex d = new BaseLabeledVertex( "D" );
- BaseLabeledVertex e = new BaseLabeledVertex( "E" );
- BaseLabeledVertex f = new BaseLabeledVertex( "F" );
- BaseLabeledVertex g = new BaseLabeledVertex( "G" );
-
- input.addVertex( a );
- input.addVertex( b );
- input.addVertex( c );
- input.addVertex( d );
- input.addVertex( e );
- input.addVertex( f );
- input.addVertex( g );
+ input.addVertex( new BaseLabeledVertex( "A" ) );
+ input.addVertex( new BaseLabeledVertex( "B" ) );
+ input.addVertex( new BaseLabeledVertex( "C" ) );
+ input.addVertex( new BaseLabeledVertex( "D" ) );
+ input.addVertex( new BaseLabeledVertex( "E" ) );
+ input.addVertex( new BaseLabeledVertex( "F" ) );
+ input.addVertex( new BaseLabeledVertex( "G" ) );
SpanningTree<BaseLabeledVertex, BaseLabeledWeightedEdge<Double>, Double> actual =
minimumSpanningTree( input ).fromArbitrarySource().applyingBoruvkaAlgorithm( new DoubleWeight() );