struct_misc.h
Go to the documentation of this file.
31/*---+----1----+----2----+----3----+----4----+----5----+----6----+----7----+----8----+----9----+----0----+----1----+----2*/
70 * Elements are stored in an array, which grows dynamically in size as new elements are added to the queue.
72 * The array is organized as follows. The root element (that is the "best" element \f$ r \f$ with \f$ r \leq x \f$ for all \f$ x \f$ )
73 * is stored in position 0. The children of an element at position \f$ p \f$ are stored at positions \f$ q_1 = 2*p+1 \f$ and
74 * \f$ q_2 = 2*p+2 \f$ . That means, the parent of the element at position \f$ q \f$ is at position \f$ p = (q-1)/2 \f$ .
75 * At any time, the condition holds that \f$ p \leq q \f$ for each parent \f$ p \f$ and its children \f$ q \f$ .
82 SCIP_DECL_PQUEUEELEMCHGPOS((*elemchgpos));/**< callback to act on position change of elem in priority queue, or NULL */
222 int** successors; /**< adjacency list: for each node (first dimension) list of all successors */
223 void*** arcdata; /**< arc data corresponding to the arcs to successors given by the successors array */
227 int* components; /**< array to store the node indices of the components, one component after the other */
228 int* componentstarts; /**< array to store the start indices of the components in the components array */
229 int* articulations; /**< array of size narticulations to store the node indices of the articulation points */
234 SCIP_Bool articulationscheck; /**< TRUE if the (computed) articulation nodes are up-to-date and FALSE otherwise */
276/** disjoint set (disjoint set (union find)) data structure for querying and updating connectedness in a graph with integer vertices 0,...,n - 1 */
297 SCIP_Bool recordmodifications;/**< whether to remember variables which coefficients were modified during cleanup */
common defines and data types used in all packages of SCIP
memory allocation routines
Definition: struct_misc.h:180
Definition: struct_misc.h:239
Definition: struct_misc.h:248
Definition: struct_misc.h:220
Definition: struct_misc.h:278
Definition: struct_misc.h:131
Definition: struct_misc.h:138
Definition: struct_misc.h:150
Definition: struct_misc.h:90
SCIP_DECL_HASHKEYVAL((*hashkeyval))
SCIP_DECL_HASHKEYEQ((*hashkeyeq))
SCIP_DECL_HASHGETKEY((*hashgetkey))
Definition: struct_misc.h:169
Definition: struct_misc.h:105
Definition: struct_misc.h:112
SCIP_DECL_HASHKEYEQ((*hashkeyeq))
SCIP_DECL_HASHGETKEY((*hashgetkey))
SCIP_DECL_HASHKEYVAL((*hashkeyval))
Definition: struct_misc.h:79
SCIP_DECL_SORTPTRCOMP((*ptrcomp))
SCIP_DECL_PQUEUEELEMCHGPOS((*elemchgpos))
Definition: struct_misc.h:210
Definition: struct_misc.h:191
Definition: struct_misc.h:61
Definition: struct_misc.h:269
Definition: struct_misc.h:158
Definition: struct_misc.h:255
Definition: struct_misc.h:202
Definition: struct_misc.h:287
Definition: struct_misc.h:47
Definition: struct_var.h:208
type definitions for miscellaneous datastructures
Definition: struct_misc.h:123
Definition: struct_misc.h:54