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
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
|
/* -*- mode: C -*- */
/*
IGraph library.
Copyright (C) 2006-2012 Gabor Csardi <csardi.gabor@gmail.com>
334 Harvard street, Cambridge, MA 02139 USA
This program is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 2 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 General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program; if not, write to the Free Software
Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA
02110-1301 USA
*/
#include <igraph.h>
#include <igraph_types_internal.h>
int main() {
igraph_d_indheap_t h;
long int idx1, idx2;
/* igraph_d_indheap_init, igraph_d_indheap_destroy */
igraph_d_indheap_init(&h, 0);
igraph_d_indheap_destroy(&h);
igraph_d_indheap_init(&h, 100);
igraph_d_indheap_destroy(&h);
/* igraph_d_indheap_empty, igraph_d_indheap_size */
igraph_d_indheap_init(&h, 10);
if (!igraph_d_indheap_empty(&h)) {
return 1;
}
if (igraph_d_indheap_size(&h) != 0) {
return 2;
}
igraph_d_indheap_push(&h, 10, 0, 0);
if (igraph_d_indheap_empty(&h)) {
return 3;
}
if (igraph_d_indheap_size(&h) != 1) {
return 4;
}
/* igraph_d_indheap_push */
igraph_d_indheap_push(&h, 9, 9, 8);
igraph_d_indheap_push(&h, 3, 3, 2);
igraph_d_indheap_push(&h, 2, 2, 1);
igraph_d_indheap_push(&h, 1, 1, 0);
igraph_d_indheap_push(&h, 7, 7, 6);
igraph_d_indheap_push(&h, 4, 4, 3);
igraph_d_indheap_push(&h, 0, 0, 1);
igraph_d_indheap_push(&h, 6, 6, 5);
igraph_d_indheap_push(&h, 5, 5, 4);
igraph_d_indheap_push(&h, 8, 8, 7);
/* igraph_d_indheap_max, igraph_d_indheap_delete_max */
while (!igraph_d_indheap_empty(&h)) {
printf("% li", (long int)igraph_d_indheap_max(&h));
printf("% li\n", (long int)igraph_d_indheap_delete_max(&h));
}
/* igraph_d_indheap_reserve */
igraph_d_indheap_reserve(&h, 5);
igraph_d_indheap_reserve(&h, 20);
igraph_d_indheap_reserve(&h, 0);
igraph_d_indheap_reserve(&h, 3);
/* igraph_d_indheap_max_index */
igraph_d_indheap_push(&h, 0, 0, 1);
igraph_d_indheap_push(&h, 8, 8, 7);
igraph_d_indheap_push(&h, 2, 2, 1);
igraph_d_indheap_push(&h, 7, 7, 6);
igraph_d_indheap_push(&h, 9, 9, 8);
igraph_d_indheap_push(&h, 4, 4, 3);
igraph_d_indheap_push(&h, 3, 3, 2);
igraph_d_indheap_push(&h, 5, 5, 4);
igraph_d_indheap_push(&h, 1, 1, 0);
igraph_d_indheap_push(&h, 6, 6, 5);
while (!igraph_d_indheap_empty(&h)) {
igraph_d_indheap_max_index(&h, &idx1, &idx2);
printf(" %li %li", idx1, idx2);
igraph_d_indheap_delete_max(&h);
}
printf("\n");
igraph_d_indheap_destroy(&h);
if (IGRAPH_FINALLY_STACK_SIZE() != 0) return 5;
return 0;
}
|
