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
|
/* -*- mode: C -*- */
/*
IGraph library.
Copyright (C) 2006-2012 Gabor Csardi <csardi.gabor@gmail.com>
334 Harvard st, 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>
void print_vector(igraph_vector_t *v, FILE *f) {
long int i;
for (i=0; i<igraph_vector_size(v); i++) {
fprintf(f, " %li", (long int) VECTOR(*v)[i]);
}
fprintf(f, "\n");
}
int main() {
igraph_i_cutheap_t ch;
long int i;
igraph_i_cutheap_init(&ch, 10);
for (i=0; i<10; i++) {
igraph_i_cutheap_update(&ch, i, i);
}
/* print_vector(&ch.heap, stdout); */
/* print_vector(&ch.index, stdout); */
/* print_vector(&ch.hptr, stdout); */
while (!igraph_i_cutheap_empty(&ch)) {
long int idx=igraph_i_cutheap_popmax(&ch);
printf("%li ", idx);
/* print_vector(&ch.heap, stdout); */
/* print_vector(&ch.index, stdout); */
/* print_vector(&ch.hptr, stdout); */
/* printf("------------\n"); */
}
printf("\n");
igraph_i_cutheap_destroy(&ch);
if (!IGRAPH_FINALLY_STACK_EMPTY) return 1;
return 0;
}
|
