This is an automated email from the ASF dual-hosted git repository. ggregory pushed a commit to branch master in repository https://gitbox.apache.org/repos/asf/commons-graph.git
commit 783a9c5c2832ed29181da22e17eeb50d48ffb241 Author: Gary Gregory <[email protected]> AuthorDate: Fri Nov 3 10:15:27 2023 -0400 Normalize test method names --- .../graph/scc/SCCAlgorithmBenchmarkTestCase.java | 6 +++--- .../UniVsBiDijkstraBenchmarkTestCase.java | 4 ++-- .../MinimumSpanningTreeBenchmarkTestCase.java | 6 +++--- .../graph/builder/GraphBuilderTestCase.java | 2 +- .../graph/collections/FibonacciHeapTestCase.java | 22 +++++++++++----------- .../FindConnectedComponetTestCase.java | 14 +++++++------- .../org/apache/commons/graph/elo/EloTestCase.java | 2 +- .../commons/graph/export/ExportTestCase.java | 6 +++--- .../commons/graph/flow/EdmondsKarpTestCase.java | 2 +- .../commons/graph/flow/FordFulkersonTestCase.java | 2 +- .../graph/model/GraphSerializationTestCase.java | 14 +++++++------- .../graph/scc/CheriyanMehlhornGabowTestCase.java | 2 +- .../commons/graph/scc/KosarajuSharirTestCase.java | 2 +- .../commons/graph/shortestpath/AStarTestCase.java | 2 +- .../graph/shortestpath/BellmannFordTestCase.java | 2 +- .../graph/shortestpath/BidirDijkstraTestCase.java | 8 ++++---- .../graph/shortestpath/DijkstraTestCase.java | 2 +- .../graph/shortestpath/FloydWarshallTestCase.java | 4 ++-- .../commons/graph/spanning/BoruvkaTestCase.java | 2 +- .../commons/graph/spanning/KruskalTestCase.java | 4 ++-- .../commons/graph/spanning/PrimTestCase.java | 4 ++-- .../graph/spanning/ReverseDeleteTestCase.java | 8 ++++---- .../apache/commons/graph/visit/VisitTestCase.java | 4 ++-- 23 files changed, 62 insertions(+), 62 deletions(-) diff --git a/src/benchmarks/java/org/apache/commons/graph/scc/SCCAlgorithmBenchmarkTestCase.java b/src/benchmarks/java/org/apache/commons/graph/scc/SCCAlgorithmBenchmarkTestCase.java index d8aef0b..24c5c0f 100644 --- a/src/benchmarks/java/org/apache/commons/graph/scc/SCCAlgorithmBenchmarkTestCase.java +++ b/src/benchmarks/java/org/apache/commons/graph/scc/SCCAlgorithmBenchmarkTestCase.java @@ -86,21 +86,21 @@ public final class SCCAlgorithmBenchmarkTestCase } @Test - public void performKosaraju() + public void testPerformKosaraju() { Set<Set<BaseLabeledVertex>> actual = findStronglyConnectedComponent( graph ).applyingKosarajuSharir(); assertTrue( actual.size() > 0 ); } @Test - public void performCheriyanMehlhornGabow() + public void testPerformCheriyanMehlhornGabow() { Set<Set<BaseLabeledVertex>> actual = findStronglyConnectedComponent( graph ).applyingCheriyanMehlhornGabow(); assertTrue( actual.size() > 0 ); } @Test - public void performTarjan() + public void testPerformTarjan() { Set<Set<BaseLabeledVertex>> actual = findStronglyConnectedComponent( graph ).applyingTarjan(); assertTrue( actual.size() > 0 ); diff --git a/src/benchmarks/java/org/apache/commons/graph/shortestpath/UniVsBiDijkstraBenchmarkTestCase.java b/src/benchmarks/java/org/apache/commons/graph/shortestpath/UniVsBiDijkstraBenchmarkTestCase.java index f1f5ea1..914ce52 100644 --- a/src/benchmarks/java/org/apache/commons/graph/shortestpath/UniVsBiDijkstraBenchmarkTestCase.java +++ b/src/benchmarks/java/org/apache/commons/graph/shortestpath/UniVsBiDijkstraBenchmarkTestCase.java @@ -158,7 +158,7 @@ public final class UniVsBiDijkstraBenchmarkTestCase } @Test - public void performUnidirectionalDijkstra() { + public void testPerformUnidirectionalDijkstra() { BaseLabeledVertex source = sourceListUni.removeFirst(); BaseLabeledVertex target = targetListUni.removeFirst(); @@ -180,7 +180,7 @@ public final class UniVsBiDijkstraBenchmarkTestCase } @Test - public void performBidirectionalDijkstra() { + public void testPerformBidirectionalDijkstra() { BaseLabeledVertex source = sourceListBi.removeFirst(); BaseLabeledVertex target = targetListBi.removeFirst(); diff --git a/src/benchmarks/java/org/apache/commons/graph/spanning/MinimumSpanningTreeBenchmarkTestCase.java b/src/benchmarks/java/org/apache/commons/graph/spanning/MinimumSpanningTreeBenchmarkTestCase.java index 23e824e..f42135c 100644 --- a/src/benchmarks/java/org/apache/commons/graph/spanning/MinimumSpanningTreeBenchmarkTestCase.java +++ b/src/benchmarks/java/org/apache/commons/graph/spanning/MinimumSpanningTreeBenchmarkTestCase.java @@ -118,7 +118,7 @@ public final class MinimumSpanningTreeBenchmarkTestCase } @Test - public void performBoruvka() + public void testPerformBoruvka() { SpanningTree<BaseLabeledVertex, BaseLabeledWeightedEdge<Double>, Double> actual = minimumSpanningTree( graph ) @@ -130,7 +130,7 @@ public final class MinimumSpanningTreeBenchmarkTestCase } @Test - public void performKruskal() + public void testPerformKruskal() { SpanningTree<BaseLabeledVertex, BaseLabeledWeightedEdge<Double>, Double> actual = minimumSpanningTree( graph ) @@ -142,7 +142,7 @@ public final class MinimumSpanningTreeBenchmarkTestCase } @Test - public void performPrim() + public void testPerformPrim() { SpanningTree<BaseLabeledVertex, BaseLabeledWeightedEdge<Double>, Double> actual = minimumSpanningTree( graph ) diff --git a/src/test/java/org/apache/commons/graph/builder/GraphBuilderTestCase.java b/src/test/java/org/apache/commons/graph/builder/GraphBuilderTestCase.java index cfe9cd0..277c340 100644 --- a/src/test/java/org/apache/commons/graph/builder/GraphBuilderTestCase.java +++ b/src/test/java/org/apache/commons/graph/builder/GraphBuilderTestCase.java @@ -31,7 +31,7 @@ public final class GraphBuilderTestCase { @Test - public void verifyProducedGraphesAreEquals() + public void testVerifyProducedGraphesAreEquals() { UndirectedMutableGraph<BaseLabeledVertex, BaseLabeledWeightedEdge<Double>> expected = new UndirectedMutableGraph<BaseLabeledVertex, BaseLabeledWeightedEdge<Double>>(); diff --git a/src/test/java/org/apache/commons/graph/collections/FibonacciHeapTestCase.java b/src/test/java/org/apache/commons/graph/collections/FibonacciHeapTestCase.java index fe75c3f..3b0a928 100644 --- a/src/test/java/org/apache/commons/graph/collections/FibonacciHeapTestCase.java +++ b/src/test/java/org/apache/commons/graph/collections/FibonacciHeapTestCase.java @@ -57,14 +57,14 @@ public final class FibonacciHeapTestCase } @Test - public void emptyWhenCreated() + public void testEmptyWhenCreated() { assertThat( queue.isEmpty(), is( true ) ); assertThat( queue.poll(), nullValue() ); } @Test - public void noLongerEmptyAfterAdd() + public void testNoLongerEmptyAfterAdd() { queue.add( 50 ); @@ -72,7 +72,7 @@ public final class FibonacciHeapTestCase } @Test - public void singletonQueueReturnsSoleItemOnPoll() + public void testSingletonQueueReturnsSoleItemOnPoll() { queue.add( 50 ); @@ -80,7 +80,7 @@ public final class FibonacciHeapTestCase } @Test - public void isEmptyAfterSoleElementRemoved() + public void testIsEmptyAfterSoleElementRemoved() { queue.add( 50 ); queue.poll(); @@ -89,7 +89,7 @@ public final class FibonacciHeapTestCase } @Test - public void returnsOrderedItems() + public void testReturnsOrderedItems() { queue.add( 100 ); queue.add( 50 ); @@ -100,7 +100,7 @@ public final class FibonacciHeapTestCase } @Test - public void insertSingleItem() + public void testInsertSingleItem() { queue.add( 50 ); @@ -109,7 +109,7 @@ public final class FibonacciHeapTestCase } @Test - public void insertSameValuesAndReturnsOrderedItems() + public void testInsertSameValuesAndReturnsOrderedItems() { queue.add( 50 ); queue.add( 100 ); @@ -122,7 +122,7 @@ public final class FibonacciHeapTestCase } @Test - public void returnsOrderedItemsFromRandomInsert() + public void testReturnsOrderedItemsFromRandomInsert() { final Random r = new Random( System.currentTimeMillis() ); final List<Integer> expected = new ArrayList<Integer>(); @@ -146,7 +146,7 @@ public final class FibonacciHeapTestCase } @Test - public void addAllAndContinsItem() + public void testAddAllAndContinsItem() { Collection<Integer> c = new ArrayList<Integer>(); @@ -167,7 +167,7 @@ public final class FibonacciHeapTestCase } @Test - public void clearQueue() + public void testClearQueue() { final Random r = new Random( System.currentTimeMillis() ); for ( int i = 0; i < 1000; i++ ) @@ -182,7 +182,7 @@ public final class FibonacciHeapTestCase } @Test - public void offerPeekAndElement() + public void testOfferPeekAndElement() { queue.offer( 50 ); queue.offer( 100 ); diff --git a/src/test/java/org/apache/commons/graph/connectivity/FindConnectedComponetTestCase.java b/src/test/java/org/apache/commons/graph/connectivity/FindConnectedComponetTestCase.java index cad923f..afbd60c 100644 --- a/src/test/java/org/apache/commons/graph/connectivity/FindConnectedComponetTestCase.java +++ b/src/test/java/org/apache/commons/graph/connectivity/FindConnectedComponetTestCase.java @@ -48,7 +48,7 @@ public final class FindConnectedComponetTestCase } @Test - public void verifyEmptyGraph() + public void testVerifyEmptyGraph() { UndirectedMutableGraph<BaseLabeledVertex, BaseLabeledEdge> graph = new UndirectedMutableGraph<BaseLabeledVertex, BaseLabeledEdge>(); @@ -60,7 +60,7 @@ public final class FindConnectedComponetTestCase } @Test - public void verifyNullVerticesGraph() + public void testVerifyNullVerticesGraph() { UndirectedMutableGraph<BaseLabeledVertex, BaseLabeledEdge> graph = newUndirectedMutableGraph( new AbstractGraphConnection<BaseLabeledVertex, BaseLabeledEdge>() @@ -80,7 +80,7 @@ public final class FindConnectedComponetTestCase } @Test - public void verifyConnectedComponents() + public void testVerifyConnectedComponents() { final BaseLabeledVertex a = new BaseLabeledVertex( "A" ); @@ -110,7 +110,7 @@ public final class FindConnectedComponetTestCase } @Test - public void verifyConnectedComponents2() + public void testVerifyConnectedComponents2() { final BaseLabeledVertex a = new BaseLabeledVertex( "A" ); @@ -148,7 +148,7 @@ public final class FindConnectedComponetTestCase } @Test - public void verifyConnectedComponents3() + public void testVerifyConnectedComponents3() { final BaseLabeledVertex a = new BaseLabeledVertex( "A" ); @@ -177,7 +177,7 @@ public final class FindConnectedComponetTestCase } @Test - public void verifyConnectedComponentsIncludingVertices() + public void testVerifyConnectedComponentsIncludingVertices() { final BaseLabeledVertex a = new BaseLabeledVertex( "A" ); @@ -215,7 +215,7 @@ public final class FindConnectedComponetTestCase } @Test - public void verifyConnectedComponentsIncludingVertices2() + public void testVerifyConnectedComponentsIncludingVertices2() { final BaseLabeledVertex a = new BaseLabeledVertex( "A" ); final BaseLabeledVertex e = new BaseLabeledVertex( "E" ); diff --git a/src/test/java/org/apache/commons/graph/elo/EloTestCase.java b/src/test/java/org/apache/commons/graph/elo/EloTestCase.java index ff8deda..083ffb7 100644 --- a/src/test/java/org/apache/commons/graph/elo/EloTestCase.java +++ b/src/test/java/org/apache/commons/graph/elo/EloTestCase.java @@ -35,7 +35,7 @@ public final class EloTestCase { @Test - public void performElo() + public void testPerformElo() { DirectedGraph<String, GameResult> tournament = newDirectedMutableGraph( new AbstractGraphConnection<String, GameResult>() diff --git a/src/test/java/org/apache/commons/graph/export/ExportTestCase.java b/src/test/java/org/apache/commons/graph/export/ExportTestCase.java index dc0fc82..476434c 100644 --- a/src/test/java/org/apache/commons/graph/export/ExportTestCase.java +++ b/src/test/java/org/apache/commons/graph/export/ExportTestCase.java @@ -65,7 +65,7 @@ public class ExportTestCase { } @Test - public void shouldPrintDotFormat() + public void testShouldPrintDotFormat() throws Exception { export( actual ).withName( "DotFormatGraph" ) @@ -77,7 +77,7 @@ public class ExportTestCase { } @Test - public void shouldPrintGraphML() + public void testShouldPrintGraphML() throws Exception { export( actual ).withName( "GraphMLGraph" ) @@ -89,7 +89,7 @@ public class ExportTestCase { } @Test - public void shouldPrintGraphMLFormat() + public void testShouldPrintGraphMLFormat() throws Exception { export( actual ).usingGraphMLFormat().to( System.out ); diff --git a/src/test/java/org/apache/commons/graph/flow/EdmondsKarpTestCase.java b/src/test/java/org/apache/commons/graph/flow/EdmondsKarpTestCase.java index 53b6a0a..8553780 100644 --- a/src/test/java/org/apache/commons/graph/flow/EdmondsKarpTestCase.java +++ b/src/test/java/org/apache/commons/graph/flow/EdmondsKarpTestCase.java @@ -110,7 +110,7 @@ public class EdmondsKarpTestCase } @Test - public void findMaxFlowAndVerify() + public void testFindMaxFlowAndVerify() { final BaseLabeledVertex a = new BaseLabeledVertex( "A" ); final BaseLabeledVertex g = new BaseLabeledVertex( "G" ); diff --git a/src/test/java/org/apache/commons/graph/flow/FordFulkersonTestCase.java b/src/test/java/org/apache/commons/graph/flow/FordFulkersonTestCase.java index d4d2a56..c88ae17 100644 --- a/src/test/java/org/apache/commons/graph/flow/FordFulkersonTestCase.java +++ b/src/test/java/org/apache/commons/graph/flow/FordFulkersonTestCase.java @@ -148,7 +148,7 @@ public final class FordFulkersonTestCase } @Test - public void findMaxFlowAndVerify() + public void testFindMaxFlowAndVerify() { final BaseLabeledVertex a = new BaseLabeledVertex( "A" ); final BaseLabeledVertex d = new BaseLabeledVertex( "D" ); diff --git a/src/test/java/org/apache/commons/graph/model/GraphSerializationTestCase.java b/src/test/java/org/apache/commons/graph/model/GraphSerializationTestCase.java index 76e4e60..aaa0e04 100644 --- a/src/test/java/org/apache/commons/graph/model/GraphSerializationTestCase.java +++ b/src/test/java/org/apache/commons/graph/model/GraphSerializationTestCase.java @@ -61,7 +61,7 @@ public class GraphSerializationTestCase } @Test - public void serializeUndirectedGraph() + public void testSerializeUndirectedGraph() throws Exception { MutableGraph<BaseLabeledVertex, BaseLabeledEdge> g = newUndirectedMutableGraph( buildGraphConnections() ); @@ -70,7 +70,7 @@ public class GraphSerializationTestCase } @Test - public void serializeDirectedGraph() + public void testSerializeDirectedGraph() throws Exception { MutableGraph<BaseLabeledVertex, BaseLabeledEdge> g = newDirectedMutableGraph( buildGraphConnections() ); @@ -79,7 +79,7 @@ public class GraphSerializationTestCase } @Test - public void serializeUndirectedWeightdGraph() + public void testSerializeUndirectedWeightdGraph() throws Exception { MutableGraph<BaseLabeledVertex, BaseLabeledWeightedEdge<Double>> g = @@ -89,7 +89,7 @@ public class GraphSerializationTestCase } @Test - public void serializeDirectedWeightdGraph() + public void testSerializeDirectedWeightdGraph() throws Exception { MutableGraph<BaseLabeledVertex, BaseLabeledWeightedEdge<Double>> g = @@ -99,7 +99,7 @@ public class GraphSerializationTestCase } @Test - public void serializeSpanningTree() + public void testSerializeSpanningTree() throws Exception { final MutableSpanningTree<BaseLabeledVertex, BaseLabeledWeightedEdge<Double>, Double> spanningTree = @@ -113,7 +113,7 @@ public class GraphSerializationTestCase } @Test - public void serializeSyncronyzedDirectedWeightdGraph() + public void testSerializeSyncronyzedDirectedWeightdGraph() throws Exception { Graph<BaseLabeledVertex, BaseLabeledWeightedEdge<Double>> g = @@ -123,7 +123,7 @@ public class GraphSerializationTestCase } @Test - public void serializePath() + public void testSerializePath() throws Exception { BaseLabeledVertex start = new BaseLabeledVertex( "start" ); diff --git a/src/test/java/org/apache/commons/graph/scc/CheriyanMehlhornGabowTestCase.java b/src/test/java/org/apache/commons/graph/scc/CheriyanMehlhornGabowTestCase.java index fd5d75f..c20afc2 100644 --- a/src/test/java/org/apache/commons/graph/scc/CheriyanMehlhornGabowTestCase.java +++ b/src/test/java/org/apache/commons/graph/scc/CheriyanMehlhornGabowTestCase.java @@ -87,7 +87,7 @@ public final class CheriyanMehlhornGabowTestCase } @Test - public void verifyHasStronglyConnectedComponents() + public void testVerifyHasStronglyConnectedComponents() { final BaseLabeledVertex a = new BaseLabeledVertex( "A" ); final BaseLabeledVertex b = new BaseLabeledVertex( "B" ); diff --git a/src/test/java/org/apache/commons/graph/scc/KosarajuSharirTestCase.java b/src/test/java/org/apache/commons/graph/scc/KosarajuSharirTestCase.java index 783b96a..b06049b 100644 --- a/src/test/java/org/apache/commons/graph/scc/KosarajuSharirTestCase.java +++ b/src/test/java/org/apache/commons/graph/scc/KosarajuSharirTestCase.java @@ -70,7 +70,7 @@ public final class KosarajuSharirTestCase } @Test - public void verifyHasStronglyConnectedComponents() + public void testVerifyHasStronglyConnectedComponents() { final BaseLabeledVertex a = new BaseLabeledVertex( "A" ); final BaseLabeledVertex b = new BaseLabeledVertex( "B" ); diff --git a/src/test/java/org/apache/commons/graph/shortestpath/AStarTestCase.java b/src/test/java/org/apache/commons/graph/shortestpath/AStarTestCase.java index ed996da..bd1e143 100644 --- a/src/test/java/org/apache/commons/graph/shortestpath/AStarTestCase.java +++ b/src/test/java/org/apache/commons/graph/shortestpath/AStarTestCase.java @@ -153,7 +153,7 @@ public final class AStarTestCase * <a href="http://en.wikipedia.org/wiki/A*_search_algorithm";>Wikipedia</a> */ @Test - public void findShortestPathAndVerify() + public void testFindShortestPathAndVerify() { UndirectedMutableGraph<BaseLabeledVertex, BaseLabeledWeightedEdge<Double>> graph = new UndirectedMutableGraph<BaseLabeledVertex, BaseLabeledWeightedEdge<Double>>(); diff --git a/src/test/java/org/apache/commons/graph/shortestpath/BellmannFordTestCase.java b/src/test/java/org/apache/commons/graph/shortestpath/BellmannFordTestCase.java index f2d4797..bcdd2cb 100644 --- a/src/test/java/org/apache/commons/graph/shortestpath/BellmannFordTestCase.java +++ b/src/test/java/org/apache/commons/graph/shortestpath/BellmannFordTestCase.java @@ -120,7 +120,7 @@ public final class BellmannFordTestCase * <a href="http://compprog.wordpress.com/2007/11/29/one-source-shortest-path-the-bellman-ford-algorithm/";>Wikipedia</a> */ @Test - public void findShortestPathAndVerify() + public void testFindShortestPathAndVerify() { // the input graph DirectedMutableGraph<BaseLabeledVertex, BaseLabeledWeightedEdge<Double>> graph = diff --git a/src/test/java/org/apache/commons/graph/shortestpath/BidirDijkstraTestCase.java b/src/test/java/org/apache/commons/graph/shortestpath/BidirDijkstraTestCase.java index 662cef4..107e491 100644 --- a/src/test/java/org/apache/commons/graph/shortestpath/BidirDijkstraTestCase.java +++ b/src/test/java/org/apache/commons/graph/shortestpath/BidirDijkstraTestCase.java @@ -180,7 +180,7 @@ public final class BidirDijkstraTestCase * <a href="http://en.wikipedia.org/wiki/Dijkstra's_algorithm>Wikipedia</a> */ @Test - public void findShortestPathAndVerify() + public void testFindShortestPathAndVerify() { DirectedMutableGraph<BaseLabeledVertex, BaseLabeledWeightedEdge<Double>> graph = new DirectedMutableGraph<BaseLabeledVertex, BaseLabeledWeightedEdge<Double>>(); @@ -238,7 +238,7 @@ public final class BidirDijkstraTestCase } @Test - public void verifyTwoNodePath() { + public void testVerifyTwoNodePath() { DirectedMutableGraph<BaseLabeledVertex, BaseLabeledWeightedEdge<Double>> graph = new DirectedMutableGraph<BaseLabeledVertex, BaseLabeledWeightedEdge<Double>>(); @@ -271,7 +271,7 @@ public final class BidirDijkstraTestCase } @Test - public void verifyThreeNodePath() { + public void testVerifyThreeNodePath() { DirectedMutableGraph<BaseLabeledVertex, BaseLabeledWeightedEdge<Double>> graph = new DirectedMutableGraph<BaseLabeledVertex, BaseLabeledWeightedEdge<Double>>(); @@ -308,7 +308,7 @@ public final class BidirDijkstraTestCase } @Test - public void compareToUnidirectional() { + public void testCompareToUnidirectional() { // It is hard to get unidirectional Dijkstra's algorithm wrong; // therefore compare a sequence of outputs. Random r = new Random(); diff --git a/src/test/java/org/apache/commons/graph/shortestpath/DijkstraTestCase.java b/src/test/java/org/apache/commons/graph/shortestpath/DijkstraTestCase.java index e0553fe..8c3af71 100644 --- a/src/test/java/org/apache/commons/graph/shortestpath/DijkstraTestCase.java +++ b/src/test/java/org/apache/commons/graph/shortestpath/DijkstraTestCase.java @@ -104,7 +104,7 @@ public final class DijkstraTestCase * <a href="http://en.wikipedia.org/wiki/Dijkstra's_algorithm>Wikipedia</a> */ @Test - public void findShortestPathAndVerify() + public void testFindShortestPathAndVerify() { DirectedMutableGraph<BaseLabeledVertex, BaseLabeledWeightedEdge<Double>> graph = new DirectedMutableGraph<BaseLabeledVertex, BaseLabeledWeightedEdge<Double>>(); diff --git a/src/test/java/org/apache/commons/graph/shortestpath/FloydWarshallTestCase.java b/src/test/java/org/apache/commons/graph/shortestpath/FloydWarshallTestCase.java index 5d697ef..195bd4d 100644 --- a/src/test/java/org/apache/commons/graph/shortestpath/FloydWarshallTestCase.java +++ b/src/test/java/org/apache/commons/graph/shortestpath/FloydWarshallTestCase.java @@ -74,13 +74,13 @@ public class FloydWarshallTestCase } @Test - public void undirectedShortestPath() + public void testUndirectedShortestPath() { findShortestPathAndVerify( new UndirectedMutableGraph<BaseLabeledVertex, BaseLabeledWeightedEdge<Double>>() ); } @Test - public void directedShortestPath() + public void testDirectedShortestPath() { findShortestPathAndVerify( new DirectedMutableGraph<BaseLabeledVertex, BaseLabeledWeightedEdge<Double>>() ); } diff --git a/src/test/java/org/apache/commons/graph/spanning/BoruvkaTestCase.java b/src/test/java/org/apache/commons/graph/spanning/BoruvkaTestCase.java index 433fe1f..7a1c5f1 100644 --- a/src/test/java/org/apache/commons/graph/spanning/BoruvkaTestCase.java +++ b/src/test/java/org/apache/commons/graph/spanning/BoruvkaTestCase.java @@ -106,7 +106,7 @@ public final class BoruvkaTestCase * Test Graph and boruvka's solution can be seen on */ @Test - public void verifyWikipediaMinimumSpanningTree() + public void testVerifyWikipediaMinimumSpanningTree() { UndirectedMutableGraph<BaseLabeledVertex, BaseLabeledWeightedEdge<Double>> input = new UndirectedMutableGraph<BaseLabeledVertex, BaseLabeledWeightedEdge<Double>>(); diff --git a/src/test/java/org/apache/commons/graph/spanning/KruskalTestCase.java b/src/test/java/org/apache/commons/graph/spanning/KruskalTestCase.java index bbfd676..9b6d82c 100644 --- a/src/test/java/org/apache/commons/graph/spanning/KruskalTestCase.java +++ b/src/test/java/org/apache/commons/graph/spanning/KruskalTestCase.java @@ -108,7 +108,7 @@ public final class KruskalTestCase * <a href="http://en.wikipedia.org/wiki/Prim%27s_algorithm";>Wikipedia</a> */ @Test - public void verifyWikipediaMinimumSpanningTree() + public void testVerifyWikipediaMinimumSpanningTree() { UndirectedMutableGraph<BaseLabeledVertex, BaseLabeledWeightedEdge<Double>> input = new UndirectedMutableGraph<BaseLabeledVertex, BaseLabeledWeightedEdge<Double>>(); @@ -184,7 +184,7 @@ public final class KruskalTestCase * <a href="http://en.wikipedia.org/wiki/Prim%27s_algorithm";>Wikipedia</a> */ @Test - public void verifyNotConnectedMinimumSpanningTree() + public void testVerifyNotConnectedMinimumSpanningTree() { UndirectedMutableGraph<BaseLabeledVertex, BaseLabeledWeightedEdge<Double>> input = new UndirectedMutableGraph<BaseLabeledVertex, BaseLabeledWeightedEdge<Double>>(); diff --git a/src/test/java/org/apache/commons/graph/spanning/PrimTestCase.java b/src/test/java/org/apache/commons/graph/spanning/PrimTestCase.java index 1cdb53f..8f82f6d 100644 --- a/src/test/java/org/apache/commons/graph/spanning/PrimTestCase.java +++ b/src/test/java/org/apache/commons/graph/spanning/PrimTestCase.java @@ -107,7 +107,7 @@ public final class PrimTestCase * <a href="http://gauguin.info.uniroma2.it/~italiano/Teaching/Algoritmi/Lezioni/cap12.pdf";>slides</a> */ @Test - public void verifyMinimumSpanningTree2() + public void testVerifyMinimumSpanningTree2() { UndirectedMutableGraph<BaseLabeledVertex, BaseLabeledWeightedEdge<Double>> input = new UndirectedMutableGraph<BaseLabeledVertex, BaseLabeledWeightedEdge<Double>>(); @@ -170,7 +170,7 @@ public final class PrimTestCase * <a href="http://en.wikipedia.org/wiki/Prim%27s_algorithm";>Wikipedia</a> */ @Test - public void verifyWikipediaMinimumSpanningTree() + public void testVerifyWikipediaMinimumSpanningTree() { UndirectedMutableGraph<BaseLabeledVertex, BaseLabeledWeightedEdge<Double>> input = new UndirectedMutableGraph<BaseLabeledVertex, BaseLabeledWeightedEdge<Double>>(); diff --git a/src/test/java/org/apache/commons/graph/spanning/ReverseDeleteTestCase.java b/src/test/java/org/apache/commons/graph/spanning/ReverseDeleteTestCase.java index 5f6c9b1..e3fb7bc 100644 --- a/src/test/java/org/apache/commons/graph/spanning/ReverseDeleteTestCase.java +++ b/src/test/java/org/apache/commons/graph/spanning/ReverseDeleteTestCase.java @@ -76,7 +76,7 @@ public class ReverseDeleteTestCase * Test Graph and Reverse-Delete Algorithm */ @Test - public void verifyMinimumSpanningTree() + public void testVerifyMinimumSpanningTree() { UndirectedMutableGraph<BaseLabeledVertex, BaseLabeledWeightedEdge<Double>> input = new UndirectedMutableGraph<BaseLabeledVertex, BaseLabeledWeightedEdge<Double>>(); @@ -117,7 +117,7 @@ public class ReverseDeleteTestCase * Test Graph and Reverse-Delete Algorithm */ @Test - public void verifyNotConnectGraph() + public void testVerifyNotConnectGraph() { UndirectedMutableGraph<BaseLabeledVertex, BaseLabeledWeightedEdge<Double>> input = new UndirectedMutableGraph<BaseLabeledVertex, BaseLabeledWeightedEdge<Double>>(); @@ -151,7 +151,7 @@ public class ReverseDeleteTestCase * Test Graph and Reverse-Delete Algorithm */ @Test - public void verifyNotConnectGraph2() + public void testVerifyNotConnectGraph2() { UndirectedMutableGraph<BaseLabeledVertex, BaseLabeledWeightedEdge<Double>> input = new UndirectedMutableGraph<BaseLabeledVertex, BaseLabeledWeightedEdge<Double>>(); @@ -202,7 +202,7 @@ public class ReverseDeleteTestCase * Test Graph and Reverse-Delete Algorithm */ @Test - public void verifyNotConnectGraph3() + public void testVerifyNotConnectGraph3() { UndirectedMutableGraph<BaseLabeledVertex, BaseLabeledWeightedEdge<Double>> input = new UndirectedMutableGraph<BaseLabeledVertex, BaseLabeledWeightedEdge<Double>>(); diff --git a/src/test/java/org/apache/commons/graph/visit/VisitTestCase.java b/src/test/java/org/apache/commons/graph/visit/VisitTestCase.java index ddbda74..212ff0a 100644 --- a/src/test/java/org/apache/commons/graph/visit/VisitTestCase.java +++ b/src/test/java/org/apache/commons/graph/visit/VisitTestCase.java @@ -58,7 +58,7 @@ public final class VisitTestCase * <a href="http://www.personal.kent.edu/~rmuhamma/Algorithms/MyAlgorithms/GraphAlgor/breadthSearch.htm";>here</a> */ @Test - public void verifyBreadthFirstSearch() + public void testVerifyBreadthFirstSearch() { // input graph @@ -142,7 +142,7 @@ public final class VisitTestCase * <a href="http://aiukswkelasgkelompok7.wordpress.com/metode-pencarian-dan-pelacakan/";>here</a> */ @Test - public void verifyDepthFirstSearch() + public void testVerifyDepthFirstSearch() { // expected node set final List<BaseLabeledVertex> expected = new ArrayList<BaseLabeledVertex>();
