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
73
74
75
76
77
|
/* $Id$Revision: */
/* vim:set shiftwidth=4 ts=8: */
/*************************************************************************
* Copyright (c) 2011 AT&T Intellectual Property
* All rights reserved. This program and the accompanying materials
* are made available under the terms of the Eclipse Public License v1.0
* which accompanies this distribution, and is available at
* http://www.eclipse.org/legal/epl-v10.html
*
* Contributors: See CVS logs. Details at http://www.graphviz.org/
*************************************************************************/
#ifndef BinaryHeap_H
#define BinaryHeap_H
#include "general.h"
#include "IntStack.h"
/* binary heap code.
Caution: items inserted should be kept untouched, e.g., the value of the item should be kepted unchanged while the heap is still in use!
To change the valud of am item, use BinaryHeap_reset
*/
struct BinaryHeap_struct {
int max_len;/* storage allocated for the heap */
int len;/*number of elements in the heap so far. <= maxlen */
void **heap;
int *id_to_pos;/* this array store the position of an item with ID. For ID that was not in use,
i.e., no in pos_to_id[1:len],
id_to_pos[id] = -1
*/
int *pos_to_id;/* this array stores the ID of item at position pos.
pos_to_id[id_to_pos[i]] = i, for i not in the id_stack & i < length(id_stack)+len
id_to_pos[pos_to_id[i]] = i, 0 <= i < len
*/
IntStack id_stack;/* a stack that store IDs that is no longer used, to
be assigned to newly inserted elements.
For sanity check, the union of items in
the id_stack, and that is pos_to_id[1:len],
should form a set of contiguous numbers
{1, 2, ..., len, ...}
*/
int (*cmp)(void*item1, void*item2);/* comparison function. Return 1,0,-1
if item1 >, =, < item2 */
};
enum {BinaryHeap_error_malloc = -10};
typedef struct BinaryHeap_struct* BinaryHeap;
BinaryHeap BinaryHeap_new(int (*cmp)(void*item1, void*item2));
void BinaryHeap_delete(BinaryHeap h, void (*del)(void* item));/* delete not just the heap data structure, but also the data items
through a user supplied del function. */
int BinaryHeap_insert(BinaryHeap h, void *item);/* insert an item, and return its ID.
This ID can be used later to extract the item. ID
are always nonnegative. If the return value is
negative, it is an error message */
void* BinaryHeap_get_min(BinaryHeap h);/* return the min item */
void* BinaryHeap_extract_min(BinaryHeap h);/* return and remove the min item */
void* BinaryHeap_extract_item(BinaryHeap h, int id);/* extract an item with ID out and delete it */
void* BinaryHeap_get_item(BinaryHeap h, int id);/* get an item with ID out, without deleting */
int BinaryHeap_reset(BinaryHeap h, int id, void *item);/* reset value of an item with specified id. Return new pos. If ID is invalue, return -1 */
void BinaryHeap_print(BinaryHeap h, void (*pnt)(void*));
void BinaryHeap_sanity_check(BinaryHeap h);
#endif
|
