scip_tree.h
Go to the documentation of this file.
29 /*---+----1----+----2----+----3----+----4----+----5----+----6----+----7----+----8----+----9----+----0----+----1----+----2*/
51 * if we are in probing/diving mode this method returns the node in the tree where the probing/diving mode was started.
81 /** gets depth of current node, or -1 if no current node exists; in probing, the current node is the last probing node,
84 * @return the depth of current node, or -1 if no current node exists; in probing, the current node is the last probing node,
103 /** gets depth of the focus node, or -1 if no focus node exists; the focus node is the currently processed node in the
106 * @return the depth of the focus node, or -1 if no focus node exists; the focus node is the currently processed node in the
153 /** gets the effective root depth, i.e., the depth of the deepest node which is part of all paths from the root node
183 * @return \ref SCIP_OKAY is returned if everything worked. Otherwise a suitable error code is passed. See \ref
210 * @return \ref SCIP_OKAY is returned if everything worked. Otherwise a suitable error code is passed. See \ref
237 * @return \ref SCIP_OKAY is returned if everything worked. Otherwise a suitable error code is passed. See \ref
276 /** gets the best child of the focus node w.r.t. the node selection priority assigned by the branching rule
278 * @return the best child of the focus node w.r.t. the node selection priority assigned by the branching rule
288 /** gets the best sibling of the focus node w.r.t. the node selection priority assigned by the branching rule
290 * @return the best sibling of the focus node w.r.t. the node selection priority assigned by the branching rule
336 /** gets the best node from the tree (child, sibling, or leaf) w.r.t. the node selection strategy
338 * @return the best node from the tree (child, sibling, or leaf) w.r.t. the node selection strategy
378 * @return \ref SCIP_OKAY is returned if everything worked. Otherwise a suitable error code is passed. See \ref
390 /** removes all nodes from branch and bound tree that were marked to be cut off via SCIPcutoffNode()
392 * @return \ref SCIP_OKAY is returned if everything worked. Otherwise a suitable error code is passed. See \ref
405 /** marks the given node to be propagated again the next time a node of its subtree is processed
407 * @return \ref SCIP_OKAY is returned if everything worked. Otherwise a suitable error code is passed. See \ref
445 * @return \ref SCIP_OKAY is returned if everything worked. Otherwise a suitable error code is passed. See \ref
460 * @note In order to have an effect, this method needs to be called after a node is focused but before the LP is
Definition: struct_scip.h:59
SCIP_RETCODE SCIPgetLeaves(SCIP *scip, SCIP_NODE ***leaves, int *nleaves)
Definition: scip_tree.c:239
SCIP_RETCODE SCIPgetOpenNodesData(SCIP *scip, SCIP_NODE ***leaves, SCIP_NODE ***children, SCIP_NODE ***siblings, int *nleaves, int *nchildren, int *nsiblings)
Definition: scip_tree.c:389
SCIP_Bool SCIPwasNodeLastBranchParent(SCIP *scip, SCIP_NODE *node)
Definition: scip_tree.c:722
type definitions for return codes for SCIP methods
Definition: struct_tree.h:132
SCIP_RETCODE SCIPgetSiblings(SCIP *scip, SCIP_NODE ***siblings, int *nsiblings)
Definition: scip_tree.c:197
SCIP_RETCODE SCIPrepropagateNode(SCIP *scip, SCIP_NODE *node)
Definition: scip_tree.c:468
SCIP_RETCODE SCIPgetChildren(SCIP *scip, SCIP_NODE ***children, int *nchildren)
Definition: scip_tree.c:155
type definitions for SCIP's main datastructure
type definitions for branch and bound tree
SCIP_RETCODE SCIPprintNodeRootPath(SCIP *scip, SCIP_NODE *node, FILE *file)
Definition: scip_tree.c:520
common defines and data types used in all packages of SCIP
Definition: objbenders.h:33