File: vector_qsort_ind.c

package info (click to toggle)
igraph 0.10.2%2Bds-2
  • links: PTS, VCS
  • area: main
  • in suites: bookworm
  • size: 16,176 kB
  • sloc: ansic: 121,500; cpp: 21,699; xml: 2,734; python: 411; makefile: 147; javascript: 20; sh: 9
file content (64 lines) | stat: -rw-r--r-- 2,152 bytes parent folder | download | duplicates (2)
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
/* -*- mode: C -*-  */
/*
   IGraph library.
   Copyright (C) 2006-2021  The igraph development team

   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 <stdlib.h>

#include "test_utilities.h"

int main(void) {
    igraph_vector_t vector;
    igraph_vector_int_t indices;
    igraph_real_t values[] = { 87, 23, 8, 82, 94, 56, 36, 33, 76, 66 };
    igraph_real_t values2[] = { 87, 23, 8, 82, 94, 56, 36, 33, 76, 66 };

    /* Special case: empty vector */
    igraph_vector_init(&vector, 0);
    igraph_vector_int_init(&indices, 0);
    igraph_vector_qsort_ind(&vector, &indices, IGRAPH_ASCENDING);
    print_vector_int(&indices);
    igraph_vector_int_destroy(&indices);
    igraph_vector_destroy(&vector);

    /* Non-empty vector, descending */
    igraph_vector_view(&vector, values, sizeof(values) / sizeof(values[0]));
    igraph_vector_int_init(&indices, 0);
    igraph_vector_qsort_ind(&vector, &indices, IGRAPH_DESCENDING);
    print_vector_int(&indices);

    /* Non-empty vector, ascending */
    igraph_vector_view(&vector, values2, sizeof(values2) / sizeof(values2[0]));
    igraph_vector_qsort_ind(&vector, &indices, IGRAPH_ASCENDING);
    print_vector_int(&indices);

    /* Permute the vector by the index vector */
    igraph_vector_permute(&vector, &indices);
    print_vector(&vector);

    /* Print and clean up */
    igraph_vector_int_destroy(&indices);

    /* Check finalizer stack */
    VERIFY_FINALLY_STACK();

    return 0;
}