Uses of Class
topics.branchandbound.util.Node

Packages that use Node

Package	Description
topics.branchandbound.util	Utility classes shared by branch-and-bound implementations.
topics.branchandbound.util.threads	Multi-threaded branch-and-bound utilities.

Uses of Node in topics.branchandbound.util

Classes in topics.branchandbound.util that implement interfaces with type arguments of type Node

Modifier and Type	Class	Description
class	Node	To represent the different states of a problem in the graph For each problem, we should extend this class with specific information We also need to compare Nodes because it is the way to compare them in the priority queue

Fields in topics.branchandbound.util declared as Node

Modifier and Type	Field	Description
protected Node	BranchAndBound.bestNode
protected Node	BranchAndBound.rootNode

Fields in topics.branchandbound.util with type parameters of type Node

Modifier and Type	Field	Description
protected PriorityQueue<Node>	Heap.nodes

Methods in topics.branchandbound.util that return Node

Modifier and Type	Method	Description
Node	Heap.extractBestNode()	Retrieves and removes the first element of the priority queue
Node	BranchAndBound.getBestNode()	Gets the best node
Node	BranchAndBound.getRootNode()	Gets the root node

Methods in topics.branchandbound.util that return types with arguments of type Node

Modifier and Type	Method	Description
abstract ArrayList<Node>	Node.expand()
ArrayList<Node>	Heap.extractUsedNodesFrom(Node node)	Extracts the nodes from a specific node (e.g., the solution) to the root node

Methods in topics.branchandbound.util with parameters of type Node

Modifier and Type	Method	Description
void	BranchAndBound.branchAndBound(Node rootNode)	Manages all the process, from the beginning to the end
int	Node.compareTo(Node node)
boolean	Node.equals(Node n)	Compares whether two nodes are equal using the ToString method
ArrayList<Node>	Heap.extractUsedNodesFrom(Node node)	Extracts the nodes from a specific node (e.g., the solution) to the root node
void	Heap.insert(Node node)	Inserts a new node in the priority queue

Uses of Node in topics.branchandbound.util.threads

Fields in topics.branchandbound.util.threads declared as Node

Modifier and Type	Field	Description
protected static Node	BranchAndBoundThreads.bestNode
protected static Node	BranchAndBoundThreads.rootNode

Methods in topics.branchandbound.util.threads that return Node

Modifier and Type	Method	Description
Node	HeapThreads.extractBestNode()	Retrieves and removes the first element of the priority queue
Node	BranchAndBoundThreads.getBestNode()	Gets the best node
Node	BranchAndBoundThreads.getRootNode()	Gets the root node

Methods in topics.branchandbound.util.threads that return types with arguments of type Node

Modifier and Type	Method	Description
ArrayList<Node>	HeapThreads.extractUsedNodesFrom(Node node)	Extracts the nodes from a specific node (e.g., the solution) to the root node

Methods in topics.branchandbound.util.threads with parameters of type Node

Modifier and Type	Method	Description
void	BranchAndBoundThreads.branchAndBound(Node rootNode, int numberOfThreads)	Manages all the process, from the beginning to the end
ArrayList<Node>	HeapThreads.extractUsedNodesFrom(Node node)	Extracts the nodes from a specific node (e.g., the solution) to the root node
void	HeapThreads.insert(Node node)	Inserts a new node in the priority queue