Uses of Class
topics.branchandbound.utils.Node

Packages that use Node

Package	Description
topics.branchandbound.agents
topics.branchandbound.eightpuzzle
topics.branchandbound.rectangles
topics.branchandbound.stringinterleaving
topics.branchandbound.utils
topics.branchandbound.utils.threads

Uses of Node in topics.branchandbound.agents

Subclasses of Node in topics.branchandbound.agents

Modifier and Type	Class	Description
(package private) class	AssignmentState	Represents a distinct state within the Branch and Bound execution tree for the Task Assignment problem.

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

Modifier and Type	Method	Description
ArrayList<Node>	AssignmentState.expand()	Generates all mathematically valid mathematical combinations extending from the current state.

Uses of Node in topics.branchandbound.eightpuzzle

Subclasses of Node in topics.branchandbound.eightpuzzle

Modifier and Type	Class	Description
(package private) class	PuzzleState	Represents a distinct physical configuration of the board within the execution tree.

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

Modifier and Type	Method	Description
ArrayList<Node>	PuzzleState.expand()	Generates all mathematically and physically valid child states.

Uses of Node in topics.branchandbound.rectangles

Subclasses of Node in topics.branchandbound.rectangles

Modifier and Type	Class	Description
(package private) class	BoardState	Represents a distinct physical configuration of the board within the state space tree.
(package private) class	Game	Board State for Rectangle Placement

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

Modifier and Type	Method	Description
ArrayList<Node>	BoardState.expand()	Generates all mathematically valid mathematical configurations extending from the current state by placing the next available piece.
List<Node>	Game.expand()	Generates all mathematically valid configurations extending from the current state by placing the next available piece.

Uses of Node in topics.branchandbound.stringinterleaving

Subclasses of Node in topics.branchandbound.stringinterleaving

Modifier and Type	Class	Description
class	InterleavingNode	State Node for String Interleaving

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

Modifier and Type	Method	Description
ArrayList<Node>	InterleavingNode.expand()

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

Modifier and Type	Method	Description
void	StringInterleavingGenerator.branchAndBound(Node rootNode)

Uses of Node in topics.branchandbound.utils

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

Modifier and Type	Class	Description
class	Node	State Space Tree Node

Fields in topics.branchandbound.utils declared as Node

Modifier and Type	Field	Description
protected Node	BranchAndBound.bestNode	The node representing the optimal valid configuration discovered during execution.
protected Node	BranchAndBound.rootNode	The origin state of the problem.

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

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

Methods in topics.branchandbound.utils that return Node

Modifier and Type	Method	Description
Node	Heap.extractBestNode()	Retrieves and removes the first element of the priority queue
Node	BranchAndBound.getBestNode()	Retrieves the node encapsulating the mathematically optimal path or configuration.
Node	BranchAndBound.getRootNode()	Retrieves the foundational starting state of the problem.

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

Modifier and Type	Method	Description
abstract List<Node>	Node.expand()	Generates all mathematically valid state configurations extending from this specific topological juncture.
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.utils with parameters of type Node

Modifier and Type	Method	Description
void	BranchAndBound.branchAndBound(Node initialNode)	Executes the primary Branch and Bound systemic loop.
int	Node.compareTo(Node other)	Defines the prioritization logic for the execution engine's priority queue.
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.utils.threads

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

Modifier and Type	Field	Description
protected static Node	BranchAndBoundThreads.bestNode	The node representing the optimal valid configuration discovered globally across all threads.
protected static Node	BranchAndBoundThreads.rootNode	The origin state of the problem environment.

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

Modifier and Type	Method	Description
Node	HeapThreads.extractBestNode()	Thread-safe retrieval and removal of the highest-priority node from the frontier.
Node	BranchAndBoundThreads.getBestNode()	Retrieves the node encapsulating the mathematically optimal path or configuration.
Node	BranchAndBoundThreads.getRootNode()	Retrieves the foundational starting state of the problem.

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

Modifier and Type	Method	Description
List<Node>	HeapThreads.extractUsedNodesFrom(Node targetNode)	Traces the ancestral lineage of a specific node back to the root of the execution tree.

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

Modifier and Type	Method	Description
void	BranchAndBoundThreads.branchAndBound(Node initialNode, int numberOfThreads)	Executes the multithreaded Branch and Bound systemic loop.
List<Node>	HeapThreads.extractUsedNodesFrom(Node targetNode)	Traces the ancestral lineage of a specific node back to the root of the execution tree.
void	HeapThreads.insert(Node node)	Safely inserts a new node into the priority queue if it has not been explored previously.