commons-commits mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From c.@apache.org
Subject svn commit: r1293564 - /commons/sandbox/graph/trunk/src/benchmarks/java/org/apache/commons/graph/spanning/MinimumSpanningTreeBenchmarkTestCase.java
Date Sat, 25 Feb 2012 09:52:29 GMT
Author: cs
Date: Sat Feb 25 09:52:29 2012
New Revision: 1293564

URL: http://svn.apache.org/viewvc?rev=1293564&view=rev
Log:
updated benchmark on spanning trees with new names for weight operations

Modified:
    commons/sandbox/graph/trunk/src/benchmarks/java/org/apache/commons/graph/spanning/MinimumSpanningTreeBenchmarkTestCase.java

Modified: commons/sandbox/graph/trunk/src/benchmarks/java/org/apache/commons/graph/spanning/MinimumSpanningTreeBenchmarkTestCase.java
URL: http://svn.apache.org/viewvc/commons/sandbox/graph/trunk/src/benchmarks/java/org/apache/commons/graph/spanning/MinimumSpanningTreeBenchmarkTestCase.java?rev=1293564&r1=1293563&r2=1293564&view=diff
==============================================================================
--- commons/sandbox/graph/trunk/src/benchmarks/java/org/apache/commons/graph/spanning/MinimumSpanningTreeBenchmarkTestCase.java
(original)
+++ commons/sandbox/graph/trunk/src/benchmarks/java/org/apache/commons/graph/spanning/MinimumSpanningTreeBenchmarkTestCase.java
Sat Feb 25 09:52:29 2012
@@ -29,7 +29,7 @@ import org.apache.commons.graph.Spanning
 import org.apache.commons.graph.model.BaseLabeledVertex;
 import org.apache.commons.graph.model.BaseLabeledWeightedEdge;
 import org.apache.commons.graph.model.UndirectedMutableWeightedGraph;
-import org.apache.commons.graph.weight.primitive.DoubleWeight;
+import org.apache.commons.graph.weight.primitive.DoubleWeightBaseOperations;
 import org.junit.BeforeClass;
 import org.junit.Rule;
 import org.junit.Test;
@@ -86,7 +86,7 @@ public final class MinimumSpanningTreeBe
     public void performBoruvka()
     {
         SpanningTree<BaseLabeledVertex, BaseLabeledWeightedEdge<Double>, Double>
actual =
-            minimumSpanningTree( G ).fromArbitrarySource().applyingBoruvkaAlgorithm( new
DoubleWeight() );
+            minimumSpanningTree( G ).fromArbitrarySource().applyingBoruvkaAlgorithm( new
DoubleWeightBaseOperations() );
 
         assertTrue( actual.getSize() > 0 );
     }
@@ -95,7 +95,7 @@ public final class MinimumSpanningTreeBe
     public void performKruskal()
     {
         SpanningTree<BaseLabeledVertex, BaseLabeledWeightedEdge<Double>, Double>
actual =
-            minimumSpanningTree( G ).fromArbitrarySource().applyingKruskalAlgorithm( new
DoubleWeight() );
+            minimumSpanningTree( G ).fromArbitrarySource().applyingKruskalAlgorithm( new
DoubleWeightBaseOperations() );
 
         assertTrue( actual.getSize() > 0 );
     }
@@ -104,7 +104,7 @@ public final class MinimumSpanningTreeBe
     public void performPrim()
     {
         SpanningTree<BaseLabeledVertex, BaseLabeledWeightedEdge<Double>, Double>
actual =
-            minimumSpanningTree( G ).fromArbitrarySource().applyingPrimAlgorithm( new DoubleWeight()
);
+            minimumSpanningTree( G ).fromArbitrarySource().applyingPrimAlgorithm( new DoubleWeightBaseOperations()
);
 
         assertTrue( actual.getSize() > 0 );
     }



Mime
View raw message