scip_tree.h
Go to the documentation of this file.
29 /*---+----1----+----2----+----3----+----4----+----5----+----6----+----7----+----8----+----9----+----0----+----1----+----2*/
70 * if we are in probing/diving mode this method returns the node in the tree where the probing/diving mode was started.
100 /** gets depth of current node, or -1 if no current node exists; in probing, the current node is the last probing node,
103 * @return the depth of current node, or -1 if no current node exists; in probing, the current node is the last probing node,
122 /** gets depth of the focus node, or -1 if no focus node exists; the focus node is the currently processed node in the
125 * @return the depth of the focus node, or -1 if no focus node exists; the focus node is the currently processed node in the
172 /** gets the effective root depth, i.e., the depth of the deepest node which is part of all paths from the root node
202 * @return \ref SCIP_OKAY is returned if everything worked. Otherwise a suitable error code is passed. See \ref
229 * @return \ref SCIP_OKAY is returned if everything worked. Otherwise a suitable error code is passed. See \ref
256 * @return \ref SCIP_OKAY is returned if everything worked. Otherwise a suitable error code is passed. See \ref
295 /** gets the best child of the focus node w.r.t. the node selection priority assigned by the branching rule
297 * @return the best child of the focus node w.r.t. the node selection priority assigned by the branching rule
307 /** gets the best sibling of the focus node w.r.t. the node selection priority assigned by the branching rule
309 * @return the best sibling of the focus node w.r.t. the node selection priority assigned by the branching rule
355 /** gets the best node from the tree (child, sibling, or leaf) w.r.t. the node selection strategy
357 * @return the best node from the tree (child, sibling, or leaf) w.r.t. the node selection strategy
397 * @return \ref SCIP_OKAY is returned if everything worked. Otherwise a suitable error code is passed. See \ref
409 /** marks the given node to be propagated again the next time a node of its subtree is processed
411 * @return \ref SCIP_OKAY is returned if everything worked. Otherwise a suitable error code is passed. See \ref
449 * @return \ref SCIP_OKAY is returned if everything worked. Otherwise a suitable error code is passed. See \ref
464 * @note In order to have an effect, this method needs to be called after a node is focused but before the LP is
internal methods for branch and bound tree
Definition: struct_scip.h:58
SCIP_RETCODE SCIPgetLeaves(SCIP *scip, SCIP_NODE ***leaves, int *nleaves)
Definition: scip_tree.c:315
SCIP_RETCODE SCIPgetOpenNodesData(SCIP *scip, SCIP_NODE ***leaves, SCIP_NODE ***children, SCIP_NODE ***siblings, int *nleaves, int *nchildren, int *nsiblings)
Definition: scip_tree.c:465
type definitions for return codes for SCIP methods
Definition: struct_tree.h:133
SCIP_RETCODE SCIPgetSiblings(SCIP *scip, SCIP_NODE ***siblings, int *nsiblings)
Definition: scip_tree.c:273
SCIP_RETCODE SCIPrepropagateNode(SCIP *scip, SCIP_NODE *node)
Definition: scip_tree.c:522
SCIP_RETCODE SCIPgetChildren(SCIP *scip, SCIP_NODE ***children, int *nchildren)
Definition: scip_tree.c:231
type definitions for SCIP's main datastructure
internal miscellaneous methods
internal methods for global SCIP settings
SCIP main data structure.
internal methods for problem variables
methods for debugging
type definitions for branch and bound tree
datastructures for problem statistics
SCIP_RETCODE SCIPprintNodeRootPath(SCIP *scip, SCIP_NODE *node, FILE *file)
Definition: scip_tree.c:574
internal methods for main solving loop and node processing
internal methods for constraints and constraint handlers
common defines and data types used in all packages of SCIP
Definition: objbenders.h:33