IDAStar.Iterator

Class Overview

IDA iterator. It expands the next state to be explored. Backtracking is automatically performed so if the state reaches a dead-end the next call to iterator.next() returns the next state after performing backtracking.

Summary

[Expand] Inherited Fields
From class es.usc.citius.hipster.algorithm.DepthFirstSearch.Iterator protected Set<S> closed protected boolean graphSupport protected StackFrameNode next protected Deque<StackFrameNode> stack

[Expand] Inherited Methods
From class es.usc.citius.hipster.algorithm.DepthFirstSearch.Iterator Set<S> getClosed() StackFrameNode getNext() Deque<StackFrameNode> getStack() boolean hasNext() boolean isGraphSupport() N next() StackFrameNode nextUnvisited() StackFrameNode processNextNode() void remove() void setClosed(Set<S> closed) void setGraphSupport(boolean graphSupport) void setNext(StackFrameNode next) void setStack(Deque<StackFrameNode> stack)
From class java.lang.Object Object clone() boolean equals(Object arg0) void finalize() final Class<?> getClass() int hashCode() final void notify() final void notifyAll() String toString() final void wait() final void wait(long arg0, int arg1) final void wait(long arg0)
From interface java.util.Iterator abstract boolean hasNext() abstract E next() abstract void remove()