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
|
/* ========================================================================== */
/* === Include/Mongoose_QPMinHeap.hpp ======================================= */
/* ========================================================================== */
/* -----------------------------------------------------------------------------
* Mongoose Graph Partitioning Library, Copyright (C) 2017-2023,
* Scott P. Kolodziej, Nuri S. Yeralan, Timothy A. Davis, William W. Hager
* Mongoose is licensed under Version 3 of the GNU General Public License.
* Mongoose is also available under other licenses; contact authors for details.
* SPDX-License-Identifier: GPL-3.0-only
* -------------------------------------------------------------------------- */
// #pragma once
#ifndef MONGOOSE_QPMINHEAP_HPP
#define MONGOOSE_QPMINHEAP_HPP
#include "Mongoose_Internal.hpp"
namespace Mongoose
{
void QPMinHeap_build(Int *heap, /* on input, an unsorted set of elements */
Int size, /* size of the heap */
double *x);
Int QPMinHeap_delete /* return new size of heap */
(Int *heap, /* containing indices into x, 1..n on input */
Int size, /* size of the heap */
const double *x /* not modified */
);
void QPMinHeapify(Int p, /* start at vertex p in the heap */
Int *heap, /* size n, containing indices into x */
Int size, /* heap [ ... nheap] is in use */
const double *x /* not modified */
);
Int QPMinHeap_add(Int leaf, /* the new leaf */
Int *heap, /* size n, containing indices into x */
const double *x, /* not modified */
Int size /* number of elements in heap not counting new one */
);
void QPminheap_check(Int *heap, /* vector of size n+1 */
double *x, /* vector of size n */
Int size, /* # items in heap */
Int n, Int p /* start checking at heap [p] */
);
} // end namespace Mongoose
#endif
|
