struct_gcgpqueue.h
Go to the documentation of this file.
34 /*---+----1----+----2----+----3----+----4----+----5----+----6----+----7----+----8----+----9----+----0----+----1----+----2*/
51 * Elements are stored in an array, which grows dynamically in size as new elements are added to the queue.
53 * The array is organized as follows. The root element (that is the "best" element $r$ with $r <= x$ for all $x$)
54 * is stored in position 0. The children of an element at position $p$ are stored at positions $q_1 = 2*p+1$ and
type definitions for priority queue
SCIP_DECL_SORTPTRCOMP((*ptrcomp))