From 71a051a08e05fa9cbd458272f4707a2f58646f31 Mon Sep 17 00:00:00 2001
From: jvanzyl <jvanzyl@13f79535-47bb-0310-9956-ffa450edef68>
Date: Sat, 1 Dec 2001 19:03:59 +0000
Subject: [PATCH] - 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 | 7 ++++++-
 1 file changed, 6 insertions(+), 1 deletion(-)

diff --git a/src/java/org/apache/commons/graph/BFS.java b/src/java/org/apache/commons/graph/BFS.java
index 2c7206e..123fb08 100644
--- a/src/java/org/apache/commons/graph/BFS.java
+++ b/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 {