Author: simonetripodi
Date: Sat Jun 18 00:39:10 2011
New Revision: 1137102
URL: http://svn.apache.org/viewvc?rev=1137102&view=rev
Log:
discriminated which are connected vertices in edges, avoid to assuming facts
that can be violated
Modified:
commons/sandbox/graph/trunk/src/main/java/org/apache/commons/graph/visit/Visit.java
Modified:
commons/sandbox/graph/trunk/src/main/java/org/apache/commons/graph/visit/Visit.java
URL:
http://svn.apache.org/viewvc/commons/sandbox/graph/trunk/src/main/java/org/apache/commons/graph/visit/Visit.java?rev=1137102&r1=1137101&r2=1137102&view=diff
==============================================================================
---
commons/sandbox/graph/trunk/src/main/java/org/apache/commons/graph/visit/Visit.java
(original)
+++
commons/sandbox/graph/trunk/src/main/java/org/apache/commons/graph/visit/Visit.java
Sat Jun 18 00:39:10 2011
@@ -19,6 +19,8 @@ package org.apache.commons.graph.visit;
* under the License.
*/
+import static org.apache.commons.graph.utils.Edges.getConnectedVertex;
+
import java.util.HashSet;
import java.util.LinkedList;
import java.util.Set;
@@ -93,7 +95,7 @@ public final class Visit
:
graph.getEdges( v );
for ( E e : edges )
{
- V w = e.getTail();
+ V w = getConnectedVertex( v, e );
if ( !visitedVetices.add( w ) )
{
@@ -181,7 +183,7 @@ public final class Visit
:
graph.getEdges( v );
for ( E e : edges )
{
- V w = e.getTail();
+ V w = getConnectedVertex( v, e );
if ( !visitedVetices.add( w ) )
{
