Package dev.nm.misc.algorithm.bb
Interface ActiveList
-
public interface ActiveList
This 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 boolean
add(BBNode node)
Add a node to the active list.void
clear()
Removes all of the elements from this collection.boolean
isEmpty()
Returnstrue
if this collection contains no elements.BBNode
pop()
Get the next node.
-
-
-
Method Detail
-
isEmpty
boolean isEmpty()
Returnstrue
if this collection contains no elements.- Returns:
true
if this collection contains no elements
-
add
boolean add(BBNode node)
Add a node to the active list.- Parameters:
node
- a node- Returns:
true
if 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
-
-