Package dev.nm.misc.algorithm.bb
Interface ActiveList
-
public interface ActiveListThis interface defines the node popping strategy used in a branch-and-bound algorithm, e.g., depth-first-search, best-first-search.
-
-
Method Summary
All Methods Instance Methods Abstract Methods Modifier and Type Method Description booleanadd(BBNode node)Add a node to the active list.voidclear()Removes all of the elements from this collection.booleanisEmpty()Returnstrueif this collection contains no elements.BBNodepop()Get the next node.
-
-
-
Method Detail
-
isEmpty
boolean isEmpty()
Returnstrueif this collection contains no elements.- Returns:
trueif this collection contains no elements
-
add
boolean add(BBNode node)
Add a node to the active list.- Parameters:
node- a node- Returns:
trueif this collection changed as a result of the call
-
clear
void clear()
Removes all of the elements from this collection.
-
pop
BBNode pop()
Get the next node.- Returns:
- the next node
-
-