public class

DepthFirstSearch.Iterator

extends Object
implements Iterator<E>
java.lang.Object
   ↳ es.usc.citius.hipster.algorithm.DepthFirstSearch.Iterator
Known Direct Subclasses

Class Overview

DFS iterator used to expand always the deepest non-visited node.

Summary

Fields
protected Set<S> closed
protected boolean graphSupport
protected StackFrameNode next
protected Deque<StackFrameNode> stack
Protected Constructors
DepthFirstSearch.Iterator()
Public Methods
Set<S> getClosed()
StackFrameNode getNext()
Deque<StackFrameNode> getStack()
boolean hasNext()
boolean isGraphSupport()
N next()
void remove()
void setClosed(Set<S> closed)
void setGraphSupport(boolean graphSupport)
void setNext(StackFrameNode next)
void setStack(Deque<StackFrameNode> stack)
Protected Methods
StackFrameNode nextUnvisited()
StackFrameNode processNextNode()
[Expand]
Inherited Methods
From class java.lang.Object
From interface java.util.Iterator

Fields

protected Set<S> closed

protected boolean graphSupport

protected StackFrameNode next

protected Deque<StackFrameNode> stack

Protected Constructors

protected DepthFirstSearch.Iterator ()

Public Methods

public Set<S> getClosed ()

public StackFrameNode getNext ()

public Deque<StackFrameNode> getStack ()

public boolean hasNext ()

public boolean isGraphSupport ()

public N next ()

public void remove ()

public void setClosed (Set<S> closed)

public void setGraphSupport (boolean graphSupport)

public void setNext (StackFrameNode next)

public void setStack (Deque<StackFrameNode> stack)

Protected Methods

protected StackFrameNode nextUnvisited ()

protected StackFrameNode processNextNode ()