1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
/* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */
/* */
/* This file is part of the program */
/* GCG --- Generic Column Generation */
/* a Dantzig-Wolfe decomposition based extension */
/* of the branch-cut-and-price framework */
/* SCIP --- Solving Constraint Integer Programs */
/* */
/* Copyright (C) 2010-2022 Operations Research, RWTH Aachen University */
/* Zuse Institute Berlin (ZIB) */
/* */
/* This program is free software; you can redistribute it and/or */
/* modify it under the terms of the GNU Lesser General Public License */
/* as published by the Free Software Foundation; either version 3 */
/* of the License, or (at your option) any later version. */
/* */
/* This program is distributed in the hope that it will be useful, */
/* but WITHOUT ANY WARRANTY; without even the implied warranty of */
/* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the */
/* GNU Lesser General Public License for more details. */
/* */
/* You should have received a copy of the GNU Lesser General Public License */
/* along with this program; if not, write to the Free Software */
/* Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301, USA.*/
/* */
/* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */
/**@file struct_gcgpqueue.h
* @ingroup DATASTRUCTURES
* @brief data structure for priority queue
* @author Jonas Witt
*/
/*---+----1----+----2----+----3----+----4----+----5----+----6----+----7----+----8----+----9----+----0----+----1----+----2*/
#ifndef GCG_STRUCT_GCGPQUEUE_H_
#define GCG_STRUCT_GCGPQUEUE_H_
#include "scip/def.h"
#include "scip/type_misc.h"
#include "scip/scip.h"
#include "type_gcgpqueue.h"
#ifdef __cplusplus
extern "C" {
#endif
/** @brief priority queue data structure
*
* Elements are stored in an array, which grows dynamically in size as new elements are added to the queue.
* The ordering is done through a pointer comparison function.
* The array is organized as follows. The root element (that is the "best" element $r$ with $r <= x$ for all $x$)
* is stored in position 0. The children of an element at position $p$ are stored at positions $q_1 = 2*p+1$ and
* $q_2 = 2*p+2$. That means, the parent of the element at position $q$ is at position $p = (q-1)/2$.
* At any time, the condition holds that $p <= q$ for each parent $p$ and its children $q$.
* Insertion and removal of single elements needs time $O(log n)$.
*/
struct GCG_PQueue
{
SCIP* scip; /**< SCIP data structure */
SCIP_DECL_SORTPTRCOMP((*ptrcomp)); /**< compares two data elements */
void** slots; /**< array of element slots */
int len; /**< number of used element slots */
int size; /**< total number of available element slots */
};
#ifdef __cplusplus
}
#endif
#endif /* STRUCT_GCGPQUEUE_H_ */