SCIP_NodePQ Struct Reference Detailed Descriptionnode priority queue data structure; the fields lowerboundnode, lowerbound, nlowerbounds and validlowerbound are only used for node selection rules, that don't store the lowest bound node in the first slot of the queue Definition at line 39 of file struct_nodesel.h.
Field Documentation
sum of lower bounds of all nodes in the queue Definition at line 41 of file struct_nodesel.h. Referenced by nodepqDelPos(), SCIPnodepqClear(), SCIPnodepqGetLowerboundSum(), and SCIPnodepqInsert().
node selector used for sorting the nodes in the queue Definition at line 42 of file struct_nodesel.h. Referenced by nodepqDelPos(), SCIPnodepqCompare(), SCIPnodepqGetLowerbound(), SCIPnodepqGetLowerboundNode(), SCIPnodepqGetNodesel(), and SCIPnodepqInsert().
array of element slots Definition at line 43 of file struct_nodesel.h. Referenced by nodepqDelPos(), nodepqFindNode(), nodepqResize(), SCIPnodepqBound(), SCIPnodepqClear(), SCIPnodepqFirst(), SCIPnodepqGetLowerbound(), SCIPnodepqGetLowerboundNode(), SCIPnodepqInsert(), SCIPnodepqNodes(), and SCIPnodepqSetNodesel().
position of the slot in the bfs ordered queue Definition at line 44 of file struct_nodesel.h. Referenced by nodepqDelPos(), nodepqResize(), and SCIPnodepqInsert().
queue of slots[] indices sorted by best lower bound Definition at line 45 of file struct_nodesel.h. Referenced by nodepqDelPos(), nodepqResize(), SCIPnodepqGetLowerbound(), SCIPnodepqGetLowerboundNode(), and SCIPnodepqInsert().
number of used element slots Definition at line 46 of file struct_nodesel.h. Referenced by nodepqDelPos(), nodepqFindNode(), SCIPnodepqBound(), SCIPnodepqClear(), SCIPnodepqFirst(), SCIPnodepqGetLowerbound(), SCIPnodepqGetLowerboundNode(), SCIPnodepqInsert(), SCIPnodepqLen(), and SCIPnodepqSetNodesel().
total number of available element slots Definition at line 47 of file struct_nodesel.h. Referenced by nodepqResize(). |