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/18 02:44:44 UTC

svn commit: r1137104 - /commons/sandbox/graph/trunk/src/main/java/org/apache/commons/graph/visit/Visit.java

Author: simonetripodi
Date: Sat Jun 18 00:44:44 2011
New Revision: 1137104

URL: http://svn.apache.org/viewvc?rev=1137104&view=rev
Log:
breadth/depth search by default return a covering tree

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=1137104&r1=1137103&r2=1137104&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:44:44 2011
@@ -44,10 +44,12 @@ public final class Visit
      * @param <E> the Graph edges type
      * @param graph the Graph instance has to be visited
      * @param source the root node the search begins from
+     * @return the breadth first search tree
      */
-    public final <V extends Vertex, E extends Edge<V>> void breadthFirstSearch( Graph<V, E> graph, V source )
+    public final <V extends Vertex, E extends Edge<V>> Graph<V, E> breadthFirstSearch( Graph<V, E> graph, V source )
     {
         breadthFirstSearch( graph, source, null );
+        return null;
     }
 
     /**
@@ -132,10 +134,12 @@ public final class Visit
      * @param <E> the Graph edges type
      * @param graph the Graph instance has to be visited
      * @param source the root node the search begins from
+     * @return the depth first search tree
      */
-    public final <V extends Vertex, E extends Edge<V>> void depthFirstSearch( Graph<V, E> graph, V source )
+    public final <V extends Vertex, E extends Edge<V>> Graph<V, E> depthFirstSearch( Graph<V, E> graph, V source )
     {
         depthFirstSearch( graph, source, null );
+        return null;
     }
 
     /**