commons-dev mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From jvan...@apache.org
Subject cvs commit: jakarta-commons-sandbox/graph/src/java/org/apache/commons/graph BFS.java
Date Sat, 01 Dec 2001 19:03:59 GMT
jvanzyl     01/12/01 11:03:59

  Modified:    graph/src/java/org/apache/commons/graph BFS.java
  Log:
  - definition for completeness.
  
  Revision  Changes    Path
  1.3       +6 -1      jakarta-commons-sandbox/graph/src/java/org/apache/commons/graph/BFS.java
  
  Index: BFS.java
  ===================================================================
  RCS file: /home/cvs/jakarta-commons-sandbox/graph/src/java/org/apache/commons/graph/BFS.java,v
  retrieving revision 1.2
  retrieving revision 1.3
  diff -u -r1.2 -r1.3
  --- BFS.java	2001/11/29 14:17:33	1.2
  +++ BFS.java	2001/12/01 19:03:59	1.3
  @@ -63,7 +63,12 @@
    * 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 {
  
  
  

--
To unsubscribe, e-mail:   <mailto:commons-dev-unsubscribe@jakarta.apache.org>
For additional commands, e-mail: <mailto:commons-dev-help@jakarta.apache.org>


Mime
View raw message