This repository was archived by the owner on Feb 27, 2023. It is now read-only.
-
Notifications
You must be signed in to change notification settings - Fork 62
/
Copy pathpqueue.h
64 lines (52 loc) · 2.05 KB
/
pqueue.h
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
/*
* pqueue.h
*
* Skeltrack - A Free Software skeleton tracking library
* Copyright (C) 2012 Igalia S.L.
*
* Based on the implementation at:
* http://algs4.cs.princeton.edu/44sp/IndexMinPQ.java.html
*
* Authors:
* Iago López Galeiras <iaguis@gmail.com>
*
* This library 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 library 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 at http://www.gnu.org/licenses/lgpl-3.0.txt
* for more details.
*/
#include <glib.h>
#include "skeltrack-util.h"
struct _PQueue_element {
Node *data;
guint priority;
};
typedef struct _PQueue_element PQelement;
struct _PQueue {
PQelement *elements;
guint *map;
guint size;
guint max_size;
guint width;
guint height;
};
typedef struct _PQueue PQueue;
PQueue * pqueue_new (guint max_size,
guint width,
guint height);
void pqueue_insert (PQueue *pqueue,
Node *data,
guint priority);
Node * pqueue_pop_minimum (PQueue *pqueue);
void pqueue_delete (PQueue *pqueue,
Node *data);
gboolean pqueue_has_element (PQueue *pqueue,
Node *data);
gboolean pqueue_is_empty (PQueue *pqueue);
void pqueue_free (PQueue *pqueue);