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/01/25 20:49:35 UTC
svn commit: r1235889 - in /commons/sandbox/graph/trunk/src:
main/java/org/apache/commons/graph/CommonsGraph.java
test/java/org/apache/commons/graph/scc/KosarajuSharirTestCase.java
Author: simonetripodi
Date: Wed Jan 25 19:49:35 2012
New Revision: 1235889
URL: http://svn.apache.org/viewvc?rev=1235889&view=rev
Log:
uniforming methods signatures
Modified:
commons/sandbox/graph/trunk/src/main/java/org/apache/commons/graph/CommonsGraph.java
commons/sandbox/graph/trunk/src/test/java/org/apache/commons/graph/scc/KosarajuSharirTestCase.java
Modified: commons/sandbox/graph/trunk/src/main/java/org/apache/commons/graph/CommonsGraph.java
URL: http://svn.apache.org/viewvc/commons/sandbox/graph/trunk/src/main/java/org/apache/commons/graph/CommonsGraph.java?rev=1235889&r1=1235888&r2=1235889&view=diff
==============================================================================
--- commons/sandbox/graph/trunk/src/main/java/org/apache/commons/graph/CommonsGraph.java (original)
+++ commons/sandbox/graph/trunk/src/main/java/org/apache/commons/graph/CommonsGraph.java Wed Jan 25 19:49:35 2012
@@ -100,7 +100,7 @@ public final class CommonsGraph<V extend
* @param graph the Graph which strongly connected component has to be verified.
* @return the SCC algoritm selector
*/
- public static <V extends Vertex, E extends Edge, G extends DirectedGraph<V, E>> SccAlgorithmSelector<V, E, G> calculateStronglyConnectedComponent( G graph )
+ public static <V extends Vertex, E extends Edge, G extends DirectedGraph<V, E>> SccAlgorithmSelector<V, E, G> findStronglyConnectedComponent( G graph )
{
graph = checkNotNull( graph, "Strongly Connected Component cannot be calculated from a nulla graph" );
return new DefaultSccAlgorithmSelector<V, E, G>( graph );
Modified: commons/sandbox/graph/trunk/src/test/java/org/apache/commons/graph/scc/KosarajuSharirTestCase.java
URL: http://svn.apache.org/viewvc/commons/sandbox/graph/trunk/src/test/java/org/apache/commons/graph/scc/KosarajuSharirTestCase.java?rev=1235889&r1=1235888&r2=1235889&view=diff
==============================================================================
--- commons/sandbox/graph/trunk/src/test/java/org/apache/commons/graph/scc/KosarajuSharirTestCase.java (original)
+++ commons/sandbox/graph/trunk/src/test/java/org/apache/commons/graph/scc/KosarajuSharirTestCase.java Wed Jan 25 19:49:35 2012
@@ -19,7 +19,7 @@ package org.apache.commons.graph.scc;
* under the License.
*/
-import static org.apache.commons.graph.CommonsGraph.calculateStronglyConnectedComponent;
+import static org.apache.commons.graph.CommonsGraph.findStronglyConnectedComponent;
import static org.apache.commons.graph.CommonsGraph.newDirectedMutableGraph;
import static org.junit.Assert.assertFalse;
@@ -76,7 +76,7 @@ public final class KosarajuSharirTestCas
} );
- Set<BaseLabeledVertex> ssc = calculateStronglyConnectedComponent( graph ).applyingKosarajuSharir( a );
+ Set<BaseLabeledVertex> ssc = findStronglyConnectedComponent( graph ).applyingKosarajuSharir( a );
assertFalse( ssc.isEmpty() );
}