File: igraph_read_graph_graphml.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 (213 lines) | stat: -rw-r--r-- 7,134 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
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
/* -*- mode: C -*-  */
/*
   IGraph library.
   Copyright (C) 2006-2022  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 <stdio.h>
#include <unistd.h>     /* unlink */

#include "test_utilities.h"

void custom_warning_handler (const char *reason, const char *file,
                             int line) {
    IGRAPH_UNUSED(file);
    IGRAPH_UNUSED(line);
    printf("Warning: %s\n", reason);
}

void dump_graph(const char* header, const igraph_t* g) {
    fputs(header, stdout);
    printf("Vertices: %" IGRAPH_PRId "\n", igraph_vcount(g));
    printf("Edges: %" IGRAPH_PRId "\n", igraph_ecount(g));
    printf("Directed: %i\n", igraph_is_directed(g) ? 1 : 0);
    igraph_write_graph_edgelist(g, stdout);
}

void dump_vertex_attribute_bool(const char* name, const igraph_t* g) {
    igraph_integer_t i, n = igraph_vcount(g);

    printf("Vertex attribute '%s':", name);
    for (i = 0; i < n; i++) {
        printf(" %s", VAB(g, name, i) ? "true" : "false");
    }
    printf("\n");
}

void dump_vertex_attribute_numeric(const char* name, const igraph_t* g) {
    igraph_integer_t i, n = igraph_vcount(g);

    printf("Vertex attribute '%s':", name);
    for (i = 0; i < n; i++) {
        printf(" ");
        igraph_real_printf_precise(VAN(g, name, i));
    }
    printf("\n");
}

void dump_vertex_attribute_string(const char* name, const igraph_t* g) {
    igraph_integer_t i, n = igraph_vcount(g);

    printf("Vertex attribute '%s':", name);
    for (i = 0; i < n; i++) {
        printf(" '%s'", VAS(g, name, i));
    }
    printf("\n");
}

int main(void) {
    igraph_t g;
    igraph_error_handler_t* oldhandler;
    igraph_warning_handler_t* oldwarnhandler;
    igraph_error_t result;
    FILE *ifile, *ofile;

    igraph_set_attribute_table(&igraph_cattribute_table);

    /* GraphML */
    ifile = fopen("test.graphml", "r");
    IGRAPH_ASSERT(ifile != NULL);

    oldhandler = igraph_set_error_handler(igraph_error_handler_ignore);
    oldwarnhandler = igraph_set_warning_handler(custom_warning_handler);
    if ((result = igraph_read_graph_graphml(&g, ifile, 0))) {
        /* maybe it is simply disabled at compile-time */
        if (result == IGRAPH_UNIMPLEMENTED) {
            return 77;
        }
        return 1;
    }
    igraph_set_error_handler(oldhandler);

    fclose(ifile);

    /* Write it back */
    ofile = fopen("test2.graphml", "w");
    /* If we can't create the test file, just skip the test */
    if (ofile) {
        if ((result = igraph_write_graph_graphml(&g, ofile, /*prefixattr=*/ true))) {
            printf("Received unexpected return code: %d\n", result);
            return 1;
        }
        fclose(ofile);
        unlink("test2.graphml");
    }
    dump_graph("Directed graph:\n", &g);
    dump_vertex_attribute_bool("gender", &g);
    dump_vertex_attribute_string("color", &g);
    igraph_destroy(&g);

    /* The same with undirected graph */
    ifile = fopen("test.graphml", "r");
    IGRAPH_ASSERT(ifile != NULL);
    if ((result = igraph_read_graph_graphml(&g, ifile, 0))) {
        printf("Received unexpected return code: %d\n", result);
        return 1;
    }
    fclose(ifile);
    dump_graph("Undirected graph:\n", &g);
    dump_vertex_attribute_bool("gender", &g);
    dump_vertex_attribute_string("color", &g);
    igraph_destroy(&g);

    /* Test a GraphML file with default attributes */
    ifile = fopen("graphml-default-attrs.xml", "r");
    IGRAPH_ASSERT(ifile != NULL);
    if ((result = igraph_read_graph_graphml(&g, ifile, 0))) {
        printf("Received unexpected return code: %d\n", result);
        return 1;
    }
    fclose(ifile);
    dump_graph("Graph with default attributes:\n", &g);
    dump_vertex_attribute_bool("type", &g);
    dump_vertex_attribute_string("gender", &g);
    dump_vertex_attribute_numeric("age", &g);
    dump_vertex_attribute_bool("retired", &g);
    igraph_destroy(&g);

    /* Test a GraphML file with namespaces */
    ifile = fopen("graphml-namespace.xml", "r");
    IGRAPH_ASSERT(ifile != NULL);
    if ((result = igraph_read_graph_graphml(&g, ifile, 0))) {
        printf("Received unexpected return code: %d\n", result);
        return 1;
    }
    fclose(ifile);
    dump_graph("Graph with namespace:\n", &g);
    igraph_destroy(&g);

    /* Test a not-really-valid GraphML file as it has no namespace information */
    ifile = fopen("graphml-lenient.xml", "r");
    IGRAPH_ASSERT(ifile != NULL);
    if ((result = igraph_read_graph_graphml(&g, ifile, 0))) {
        printf("Received unexpected return code: %d\n", result);
        return 1;
    }
    fclose(ifile);
    dump_graph("Graph without namespace information:\n", &g);
    igraph_destroy(&g);

    /* Test a GraphML file with excess whitespace around attribute values
     * (which we attempt to handle gracefully) */
    ifile = fopen("graphml-whitespace.xml", "r");
    IGRAPH_ASSERT(ifile != NULL);
    if ((result = igraph_read_graph_graphml(&g, ifile, 0))) {
        printf("Received unexpected return code: %d\n", result);
        return 1;
    }
    fclose(ifile);
    dump_graph("Graph with whitespace in attributes:\n", &g);
    dump_vertex_attribute_bool("type", &g);
    dump_vertex_attribute_string("name", &g);
    dump_vertex_attribute_numeric("weight", &g);
    igraph_destroy(&g);

    /* Test a GraphML file from yEd -- we should be able to parse the nodes and
     * edges */
    igraph_set_warning_handler(igraph_warning_handler_ignore);
    ifile = fopen("graphml-yed.xml", "r");
    IGRAPH_ASSERT(ifile != NULL);
    if ((result = igraph_read_graph_graphml(&g, ifile, 0))) {
        printf("Received unexpected return code: %d\n", result);
        return 1;
    }
    fclose(ifile);
    dump_graph("Graph from yEd:\n", &g);
    igraph_destroy(&g);

    /* Restore the old error handler */
    igraph_set_error_handler(igraph_error_handler_abort);

    /* Restore the old warning handler */
    igraph_set_warning_handler(oldwarnhandler);

    /* There were sometimes problems with this file */
    /* Only if called from R though, and only on random occasions, once in every
       ten reads. Do testing here doesn't make much sense, but if we have the file
       then let's do it anyway. */
    ifile = fopen("graphml-hsa05010.xml", "r");
    IGRAPH_ASSERT(ifile != NULL);
    igraph_read_graph_graphml(&g, ifile, 0);
    fclose(ifile);
    igraph_destroy(&g);

    VERIFY_FINALLY_STACK();

    return 0;
}