svn commit: r1298203 - /commons/sandbox/graph/branches/drop-marker-interfaces-feature/src/test/java/org/apache/commons/graph/connectivity/FindConnectedComponetTestCase.java

[simonetripodi]

Author: simonetripodi
Date: Wed Mar  7 23:21:34 2012
New Revision: 1298203

URL: http://svn.apache.org/viewvc?rev=1298203&view=rev
Log:
fixed compilation issues

Modified:
    
commons/sandbox/graph/branches/drop-marker-interfaces-feature/src/test/java/org/apache/commons/graph/connectivity/FindConnectedComponetTestCase.java

Modified: 
commons/sandbox/graph/branches/drop-marker-interfaces-feature/src/test/java/org/apache/commons/graph/connectivity/FindConnectedComponetTestCase.java
URL: 
http://svn.apache.org/viewvc/commons/sandbox/graph/branches/drop-marker-interfaces-feature/src/test/java/org/apache/commons/graph/connectivity/FindConnectedComponetTestCase.java?rev=1298203&r1=1298202&r2=1298203&view=diff
==============================================================================
--- 
commons/sandbox/graph/branches/drop-marker-interfaces-feature/src/test/java/org/apache/commons/graph/connectivity/FindConnectedComponetTestCase.java
 (original)
+++ 
commons/sandbox/graph/branches/drop-marker-interfaces-feature/src/test/java/org/apache/commons/graph/connectivity/FindConnectedComponetTestCase.java
 Wed Mar  7 23:21:34 2012
@@ -32,6 +32,7 @@ import org.apache.commons.graph.Graph;
 import org.apache.commons.graph.builder.AbstractGraphConnection;
 import org.apache.commons.graph.model.BaseLabeledEdge;
 import org.apache.commons.graph.model.BaseLabeledVertex;
+import org.apache.commons.graph.model.BaseLabeledWeightedEdge;
 import org.apache.commons.graph.model.UndirectedMutableGraph;
 import org.junit.Test;
 
@@ -40,13 +41,12 @@ import org.junit.Test;
 public final class FindConnectedComponetTestCase
 {
 
-    
     @Test(expected=NullPointerException.class)
     public void verifyNullGraph()
     {
-        findConnectedComponent( (Graph<Vertex, Edge>) null 
).includingAllVertices().applyingMinimumSpanningTreeAlgorithm();
+        findConnectedComponent( (Graph<BaseLabeledVertex, 
BaseLabeledWeightedEdge<Double>>) null 
).includingAllVertices().applyingMinimumSpanningTreeAlgorithm();
     }
-    
+
     @Test
     public void verifyEmptyGraph()
     {
@@ -58,7 +58,7 @@ public final class FindConnectedComponet
         assertNotNull( c );
         assertEquals( 0, c.size() );
     }
-    
+
     @Test
     public void verifyNullVerticesGraph()
     {
@@ -78,7 +78,7 @@ public final class FindConnectedComponet
         assertNotNull( c );
         assertEquals( 0, c.size() );
     }
-    
+
     @Test
     public void verifyConnectedComponents()
     {