/*
Copyright (c) 1999, 2000 Brown University, Providence, RI
All Rights Reserved
Permission to use, copy, modify, and distribute this software and its
documentation for any purpose other than its incorporation into a
commercial product is hereby granted without fee, provided that the
above copyright notice appear in all copies and that both that
copyright notice and this permission notice appear in supporting
documentation, and that the name of Brown University not be used in
advertising or publicity pertaining to distribution of the software
without specific, written prior permission.
BROWN UNIVERSITY DISCLAIMS ALL WARRANTIES WITH REGARD TO THIS
SOFTWARE, INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND
FITNESS FOR ANY PARTICULAR PURPOSE. IN NO EVENT SHALL BROWN
UNIVERSITY BE LIABLE FOR ANY SPECIAL, INDIRECT OR CONSEQUENTIAL
DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR
PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER
TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR
PERFORMANCE OF THIS SOFTWARE.
*/
package jdsl.graph.algo;
/**
* Extends DFS to create a directed Depth First Search.
*
* @author Andrew Schwerin
* @author Keith Schmidt
* @version JDSL 2.1.1
**/
import jdsl.graph.api.*;
public class DirectedDFS extends DFS {
/**
* This implementation of interestingEdges(Vertex) returns all of the
* directed edges originating at the parameter Vertex. This in turn
* yields the building of a directed DFS tree.
*
* @param v The vertex for which to find interesting edges
* @return EdgeIterator An Iterator of interesting edges
* incident to the parameter Vertex.
*/
protected EdgeIterator interestingIncidentEdges(Vertex v) {
return graph_.incidentEdges(v, EdgeDirection.OUT);
}
}
// End of class DirectedDFS