File: igraph_sparsemat9.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 (88 lines) | stat: -rw-r--r-- 2,669 bytes parent folder | download | duplicates (4)
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
/* -*- mode: C -*-  */
/*
   IGraph library.
   Copyright (C) 2011-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 "test_utilities.h"

#define DIM1 10
#define DIM2 5
#define DIM3 6

#define INT(a) (igraph_rng_get_integer(igraph_rng_default(), 0, (a)))
#define REAL() (igraph_rng_get_normal(igraph_rng_default(), 0, 1))

int main(void) {
    igraph_sparsemat_t sA, sB, sC;
    igraph_matrix_t A1, A2, A3, B, C;
    int i;

    igraph_rng_seed(igraph_rng_default(), 42);

    igraph_sparsemat_init(&sA, DIM1, DIM2, 20);
    for (i = 0; i < 10; i++) {
        igraph_sparsemat_entry(&sA, INT(DIM1 - 1), INT(DIM2 - 1), REAL());
    }
    igraph_sparsemat_compress(&sA, &sB);
    igraph_sparsemat_destroy(&sA);

    igraph_sparsemat_init(&sA, DIM2, DIM3, 20);
    for (i = 0; i < 10; i++) {
        igraph_sparsemat_entry(&sA, INT(DIM2 - 1), INT(DIM3 - 1), REAL());
    }
    igraph_sparsemat_compress(&sA, &sC);
    igraph_sparsemat_destroy(&sA);

    igraph_matrix_init(&B, 0, 0);
    igraph_sparsemat_as_matrix(&B, &sB);
    igraph_matrix_init(&C, 0, 0);
    igraph_sparsemat_as_matrix(&C, &sC);

    /* All possible products */
    igraph_sparsemat_multiply(&sB, &sC, &sA);
    igraph_matrix_init(&A1, 0, 0);
    igraph_sparsemat_as_matrix(&A1, &sA);
    igraph_matrix_init(&A2, 0, 0);
    igraph_sparsemat_dense_multiply(&B, &sC, &A2);
    igraph_matrix_init(&A3, 0, 0);
    igraph_sparsemat_multiply_by_dense(&sB, &C, &A3);

    if (igraph_matrix_maxdifference(&A1, &A2) > 1e-10 ||
        igraph_matrix_maxdifference(&A2, &A3) > 1e-10) {
        return 1;
    }

    igraph_sparsemat_destroy(&sA);
    igraph_sparsemat_destroy(&sB);
    igraph_sparsemat_destroy(&sC);

    igraph_matrix_destroy(&A1);
    igraph_matrix_destroy(&A2);
    igraph_matrix_destroy(&A3);
    igraph_matrix_destroy(&B);
    igraph_matrix_destroy(&C);

    VERIFY_FINALLY_STACK();

    return 0;
}