good! -Simo http://people.apache.org/~simonetripodi/ http://simonetripodi.livejournal.com/ http://twitter.com/simonetripodi http://www.99soft.org/
2012/2/25 <c...@apache.org>: > 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 ); > } > > --------------------------------------------------------------------- To unsubscribe, e-mail: dev-unsubscr...@commons.apache.org For additional commands, e-mail: dev-h...@commons.apache.org
