nz.ac.waikato.jdsl.graph.algo
Class DirectedDFS

java.lang.Object
  nz.ac.waikato.jdsl.graph.algo.DFS
      nz.ac.waikato.jdsl.graph.algo.DirectedDFS

Direct Known Subclasses:

DirectedFindCycleDFS

public class DirectedDFS
extends DFS

Field Summary

Fields inherited from class nz.ac.waikato.jdsl.graph.algo.DFS

BACK_EDGE, CROSS_EDGE, EDGE_TYPE, FINISH_TIME, FORWARD_EDGE, graph_, PARENT, START_TIME, TREE_EDGE, TREE_NUMBER, treeNum_, UNSEEN, UNVISITED, VERTEX_STATUS, VISITED, VISITING, visitResult_

Constructor Summary

DirectedDFS()

Method Summary

protected EdgeIterator

interestingIncidentEdges(Vertex v) This implementation of interestingEdges(Vertex) returns all of the directed edges originating at the parameter Vertex.

Methods inherited from class nz.ac.waikato.jdsl.graph.algo.DFS

cleanup, dfsVisit, execute, execute, finishTime, finishVisit, isBackEdge, isCrossEdge, isDone, isForwardEdge, isTreeEdge, isUnseen, isUnvisited, isVisited, isVisiting, parent, startTime, startVisit, status, traverseBackEdge, traverseCrossEdge, traverseForwardEdge, traverseTreeEdge, treeNumber, type

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail

DirectedDFS

public DirectedDFS()

Method Detail

interestingIncidentEdges

protected EdgeIterator interestingIncidentEdges(Vertex v)

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.

Overrides:

interestingIncidentEdges in class DFS

Parameters:

v - The vertex for which to find interesting edges

Returns:

EdgeIterator An Iterator of interesting edges incident to the parameter Vertex.