Uses of Class
topics.branchandbound.utils.Node
Packages that use Node
Package
Description
-
Uses of Node in topics.branchandbound.agents
Subclasses of Node in topics.branchandbound.agentsModifier and TypeClassDescription(package private) classRepresents 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 -
Uses of Node in topics.branchandbound.eightpuzzle
Subclasses of Node in topics.branchandbound.eightpuzzleModifier and TypeClassDescription(package private) classRepresents a distinct physical configuration of the board within the execution tree.Methods in topics.branchandbound.eightpuzzle that return types with arguments of type Node -
Uses of Node in topics.branchandbound.rectangles
Subclasses of Node in topics.branchandbound.rectanglesModifier and TypeClassDescription(package private) classRepresents a distinct physical configuration of the board within the state space tree.(package private) classBoard State for Rectangle PlacementMethods in topics.branchandbound.rectangles that return types with arguments of type NodeModifier and TypeMethodDescriptionBoardState.expand()Generates all mathematically valid mathematical configurations extending from the current state by placing the next available piece.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.stringinterleavingMethods in topics.branchandbound.stringinterleaving that return types with arguments of type NodeMethods in topics.branchandbound.stringinterleaving with parameters of type Node -
Uses of Node in topics.branchandbound.utils
Classes in topics.branchandbound.utils that implement interfaces with type arguments of type NodeFields in topics.branchandbound.utils declared as NodeModifier and TypeFieldDescriptionprotected NodeBranchAndBound.bestNodeThe node representing the optimal valid configuration discovered during execution.protected NodeBranchAndBound.rootNodeThe origin state of the problem.Fields in topics.branchandbound.utils with type parameters of type NodeMethods in topics.branchandbound.utils that return NodeModifier and TypeMethodDescriptionHeap.extractBestNode()Retrieves and removes the first element of the priority queueBranchAndBound.getBestNode()Retrieves the node encapsulating the mathematically optimal path or configuration.BranchAndBound.getRootNode()Retrieves the foundational starting state of the problem.Methods in topics.branchandbound.utils that return types with arguments of type NodeModifier and TypeMethodDescriptionNode.expand()Generates all mathematically valid state configurations extending from this specific topological juncture.Heap.extractUsedNodesFrom(Node node) Extracts the nodes from a specific node (e.g., the solution) to the root nodeMethods in topics.branchandbound.utils with parameters of type NodeModifier and TypeMethodDescriptionvoidBranchAndBound.branchAndBound(Node initialNode) Executes the primary Branch and Bound systemic loop.intDefines the prioritization logic for the execution engine's priority queue.Heap.extractUsedNodesFrom(Node node) Extracts the nodes from a specific node (e.g., the solution) to the root nodevoidInserts a new node in the priority queue -
Uses of Node in topics.branchandbound.utils.threads
Fields in topics.branchandbound.utils.threads declared as NodeModifier and TypeFieldDescriptionprotected static NodeBranchAndBoundThreads.bestNodeThe node representing the optimal valid configuration discovered globally across all threads.protected static NodeBranchAndBoundThreads.rootNodeThe origin state of the problem environment.Methods in topics.branchandbound.utils.threads that return NodeModifier and TypeMethodDescriptionHeapThreads.extractBestNode()Thread-safe retrieval and removal of the highest-priority node from the frontier.BranchAndBoundThreads.getBestNode()Retrieves the node encapsulating the mathematically optimal path or configuration.BranchAndBoundThreads.getRootNode()Retrieves the foundational starting state of the problem.Methods in topics.branchandbound.utils.threads that return types with arguments of type NodeModifier and TypeMethodDescriptionHeapThreads.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 NodeModifier and TypeMethodDescriptionvoidBranchAndBoundThreads.branchAndBound(Node initialNode, int numberOfThreads) Executes the multithreaded Branch and Bound systemic loop.HeapThreads.extractUsedNodesFrom(Node targetNode) Traces the ancestral lineage of a specific node back to the root of the execution tree.voidSafely inserts a new node into the priority queue if it has not been explored previously.