Scippy

    SCIP

    Solving Constraint Integer Programs

    SCIP_NodePQ Struct Reference

    Detailed Description

    node 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 49 of file struct_nodesel.h.

    #include <struct_nodesel.h>

    Data Fields

    SCIP_Real lowerboundsum
     
    SCIP_NODESELnodesel
     
    SCIP_NODE ** slots
     
    int * bfsposs
     
    int * bfsqueue
     
    int len
     
    int size
     

    Field Documentation

    ◆ lowerboundsum

    SCIP_Real SCIP_NodePQ::lowerboundsum

    sum of lower bounds of all nodes in the queue

    Definition at line 51 of file struct_nodesel.h.

    Referenced by nodepqDelPos(), SCIPnodepqClear(), SCIPnodepqGetLowerboundSum(), and SCIPnodepqInsert().

    ◆ nodesel

    SCIP_NODESEL* SCIP_NodePQ::nodesel

    node selector used for sorting the nodes in the queue

    Definition at line 52 of file struct_nodesel.h.

    Referenced by nodepqDelPos(), SCIPnodepqCompare(), SCIPnodepqGetLowerbound(), SCIPnodepqGetLowerboundExact(), SCIPnodepqGetLowerboundNode(), SCIPnodepqGetNodesel(), and SCIPnodepqInsert().

    ◆ slots

    ◆ bfsposs

    int* SCIP_NodePQ::bfsposs

    position of the slot in the bfs ordered queue

    Definition at line 54 of file struct_nodesel.h.

    Referenced by nodepqDelPos(), nodepqResize(), and SCIPnodepqInsert().

    ◆ bfsqueue

    int* SCIP_NodePQ::bfsqueue

    queue of slots[] indices sorted by best lower bound

    Definition at line 55 of file struct_nodesel.h.

    Referenced by nodepqDelPos(), nodepqResize(), SCIPnodepqGetLowerbound(), SCIPnodepqGetLowerboundExact(), SCIPnodepqGetLowerboundNode(), and SCIPnodepqInsert().

    ◆ len

    ◆ size

    int SCIP_NodePQ::size

    total number of available element slots

    Definition at line 57 of file struct_nodesel.h.

    Referenced by nodepqResize().