- definition for completeness.

PR:
Obtained from:
Submitted by:
Reviewed by:


git-svn-id: https://svn.apache.org/repos/asf/jakarta/commons/sandbox/graph/trunk@144583 13f79535-47bb-0310-9956-ffa450edef68

src/java/org/apache/commons/graph/BFS.java

@@ -63,7 +63,12 @@ import org.apache.commons.graph.visitor.Visitor;
  * so that it performs Dijkstra's shortest-path algorithm, for
  * instance, if you extend the VQueue class to a Priority Queue.
  *
- * @version $Id: BFS.java,v 1.2 2001/11/29 14:17:33 jvanzyl Exp $
+ * Definition of BFS: A search algorithm which considers neighbors of a vertex, 
+ * that is, outgoing edges of the vertex's predecessor in the search, before any 
+ * outgoing edges of the vertex. Extremes are searched last. This is typically 
+ * implemented with a queue.
+ * 
+ * @version $Id: BFS.java,v 1.3 2001/12/01 19:03:59 jvanzyl Exp $
  * @author <A HREF="http://www.inf.fu-berlin.de/~dahm">M. Dahm</A> 
  */
 public class BFS extends TraversalOrder {