jvanzyl 01/12/01 11:02:07
Modified: graph/src/java/org/apache/commons/graph DFS.java
Log:
- adding definition for completeness.
Revision Changes Path
1.3 +8 -1
jakarta-commons-sandbox/graph/src/java/org/apache/commons/graph/DFS.java
Index: DFS.java
===================================================================
RCS file:
/home/cvs/jakarta-commons-sandbox/graph/src/java/org/apache/commons/graph/DFS.java,v
retrieving revision 1.2
retrieving revision 1.3
diff -u -r1.2 -r1.3
--- DFS.java 2001/11/29 14:17:33 1.2
+++ DFS.java 2001/12/01 19:02:07 1.3
@@ -59,8 +59,15 @@
/**
* Visit graph with depth first search and mark discovery and finishing time in all
* vertices.
+ *
+ * Definition of a DFS:
+ * (1) Any search algorithm which considers outgoing edges of a vertex before
+ * any neighbors of the vertex, that is, outgoing edges of the vertex's predecessor
in
+ * the search. Extremes are searched first. This is easily implemented with
recursion.
+ * (2) An algorithm which marks all vertices in a directed graph in the order they
are
+ * discovered and finished, partitioning the graph into a forest.
*
- * @version $Id: DFS.java,v 1.2 2001/11/29 14:17:33 jvanzyl Exp $
+ * @version $Id: DFS.java,v 1.3 2001/12/01 19:02:07 jvanzyl Exp $
* @author <A HREF="http://www.inf.fu-berlin.de/~dahm";>M. Dahm</A>
*/
public class DFS extends TraversalOrder {
--
To unsubscribe, e-mail: <mailto:[EMAIL PROTECTED]>
For additional commands, e-mail: <mailto:[EMAIL PROTECTED]>
