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 2011/06/21 18:51:16 UTC
svn commit: r1138086 -
/commons/sandbox/graph/trunk/src/test/java/org/apache/commons/graph/visit/VisitTestCase.java
Author: simonetripodi
Date: Tue Jun 21 16:51:16 2011
New Revision: 1138086
URL: http://svn.apache.org/viewvc?rev=1138086&view=rev
Log:
modified graph according to picture, LinkedHashSet in the in-memory representation fixed the visit
Modified:
commons/sandbox/graph/trunk/src/test/java/org/apache/commons/graph/visit/VisitTestCase.java
Modified: commons/sandbox/graph/trunk/src/test/java/org/apache/commons/graph/visit/VisitTestCase.java
URL: http://svn.apache.org/viewvc/commons/sandbox/graph/trunk/src/test/java/org/apache/commons/graph/visit/VisitTestCase.java?rev=1138086&r1=1138085&r2=1138086&view=diff
==============================================================================
--- commons/sandbox/graph/trunk/src/test/java/org/apache/commons/graph/visit/VisitTestCase.java (original)
+++ commons/sandbox/graph/trunk/src/test/java/org/apache/commons/graph/visit/VisitTestCase.java Tue Jun 21 16:51:16 2011
@@ -151,8 +151,8 @@ public final class VisitTestCase
input.addEdge( new BaseLabeledEdge( "", b, e ) );
input.addEdge( new BaseLabeledEdge( "", b, f ) );
- input.addEdge( new BaseLabeledEdge( "", e, g ) );
input.addEdge( new BaseLabeledEdge( "", e, h ) );
+ input.addEdge( new BaseLabeledEdge( "", e, g ) );
// expected node set
@@ -160,10 +160,10 @@ public final class VisitTestCase
final List<BaseLabeledVertex> expected = new ArrayList<BaseLabeledVertex>();
expected.add( s );
expected.add( b );
+ expected.add( f );
expected.add( e );
- expected.add( h );
expected.add( g );
- expected.add( f );
+ expected.add( h );
expected.add( a );
expected.add( d );
expected.add( c );