Class SlowDFSDiscoverTimeIterator<T>

All Implemented Interfaces:
Serializable, Cloneable, Iterable<T>, Collection<T>, Iterator<T>, List<T>, RandomAccess, SequencedCollection<T>

public class SlowDFSDiscoverTimeIterator<T> extends DFSDiscoverTimeIterator<T>
This class implements depth-first search over a Graph, return an enumeration of the nodes of the graph in order of increasing discover time. This class follows the outNodes of the graph nodes to define the graph, but this behavior can be changed by overriding the getConnected method.
See Also:
  • Field Details

  • Constructor Details

    • SlowDFSDiscoverTimeIterator

      protected SlowDFSDiscoverTimeIterator()
      For use with extreme care by subclasses that know what they're doing.
    • SlowDFSDiscoverTimeIterator

      public SlowDFSDiscoverTimeIterator(Graph<T> G, T N)
      Construct a depth-first enumerator starting with a particular node in a directed graph.
      Parameters:
      G - the graph whose nodes to enumerate
    • SlowDFSDiscoverTimeIterator

      public SlowDFSDiscoverTimeIterator(Graph<T> G, Iterator<T> nodes)
      Construct a depth-first enumerator across the (possibly improper) subset of nodes reachable from the nodes in the given enumeration.
      Parameters:
      G - the graph whose nodes to enumerate
      nodes - the set of nodes from which to start searching
    • SlowDFSDiscoverTimeIterator

      public SlowDFSDiscoverTimeIterator(Graph<T> G) throws NullPointerException
      Constructor SlowDFSDiscoverTimeIterator.
      Throws:
      NullPointerException - if G is null
  • Method Details