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
|
/*
IGraph library.
Copyright (C) 2021 The igraph development team <igraph@igraph.org>
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, see <https://www.gnu.org/licenses/>.
*/
#include <igraph.h>
#include "test_utilities.h"
int main(void) {
igraph_vector_t v1, v2, v3, v4, v5, v6, v7, v8;
igraph_vector_init_real(&v1, 3, 1e30, 2e30, 9e30);
igraph_vector_init_real(&v2, 3, 1e30, 2e30, 3e30);
igraph_vector_init_real(&v3, 2, 1e30, 2e30);
igraph_vector_init_real(&v4, 0);
igraph_vector_init_real(&v5, 3, 1e30, 2e30, 9e30);
igraph_vector_init_real(&v6, 0);
igraph_vector_init_real(&v7, 3, 9e30, 2e30, 1e30);
igraph_vector_init_real(&v8, 2, 3e30, 3e30);
igraph_vector_t *vectors[] = {&v1, &v2, &v3, &v4, &v5, &v6, &v7, &v8};
size_t n = sizeof(vectors) / sizeof(igraph_vector_t *);
printf("Lexicographical ordering:\n");
igraph_qsort(vectors, n, sizeof(igraph_vector_t *), igraph_vector_lex_cmp_untyped);
for (size_t i = 0; i < n; i++) {
print_vector(vectors[i]);
}
printf("\nColexicographical ordering:\n");
igraph_qsort(vectors, n, sizeof(igraph_vector_t *), igraph_vector_colex_cmp_untyped);
for (size_t i = 0; i < n; i++) {
print_vector(vectors[i]);
igraph_vector_destroy(vectors[i]);
}
VERIFY_FINALLY_STACK();
return 0;
}
|
