java.lang.Object |
↳ |
es.usc.citius.hipster.algorithm.BreadthFirstSearch.Iterator |
Class Overview
Implements all the BFS search logic as an iterator
Summary
Fields |
protected
Queue<N extends Node<A, S, N>> |
queue |
|
protected
Map<S, N extends Node<A, S, N>> |
visited |
|
[Expand]
Inherited Methods |
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()
|
|
Fields
protected
Queue<N extends Node<A, S, N>>
queue
protected
Map<S, N extends Node<A, S, N>>
visited
Protected Constructors
protected
BreadthFirstSearch.Iterator
()
Iterator cannot be instantiated from outside.
Use iterator()
to create a new BFS iterator.
Public Methods
public
Queue<N>
getQueue
()
public
Map<S, N>
getVisited
()
public
boolean
hasNext
()
public
void
setQueue
(Queue<N> queue)
public
void
setVisited
(Map<S, N> visited)