3 /* A few basic tests for the graphxml library */
5 /* Copyright (c) 2006 Darina Dimitrova, Arnaud Legrand. All rights reserved.*/
7 /* This program is free software; you can redistribute it and/or modify it
8 * under the terms of the license (GNU LGPL) which comes with this package. */
14 #include "xbt/module.h"
15 #include "xbt/sysdep.h"
16 #include "xbt/graph.h"
17 #include "xbt/graphxml.h"
20 XBT_LOG_NEW_DEFAULT_CATEGORY(test, "Logging specific to graphxml test");
23 static void *node_label_and_data(xbt_node_t node, const char *label,
26 char *lbl = xbt_strdup(label);
29 #define free_label free
31 static const char *node_name(xbt_node_t n)
33 return xbt_graph_node_get_data(n);
36 void test(char *graph_file);
37 void test(char *graph_file)
39 int test_node_deletion = 0;
40 int test_edge_deletion = 0;
41 int test_export_xml = 1;
42 int test_export_dot = 1;
43 int test_export_length = 1;
44 int test_shortest_paths = 1;
45 int test_topo_sort = 1;
50 xbt_dynar_t edges = NULL;
51 xbt_dynar_t nodes = NULL;
54 xbt_graph_read(graph_file, &node_label_and_data, NULL);
56 n = xbt_dynar_length(xbt_graph_get_nodes(graph));
58 if (test_export_xml) {
59 INFO0("---- Testing XML export. Exporting to testgraph.xml ----");
60 xbt_graph_export_graphxml(graph, "testgraph.xml", NULL, NULL, NULL,
63 if (test_export_dot) {
64 INFO0("---- Testing GraphViz export. Exporting to testgraph.dot ----");
65 xbt_graph_export_graphviz(graph, "testgraph.dot", node_name, NULL);
68 if (test_export_length) {
72 INFO0("---- Dumping Edge lengths ----");
73 adj = xbt_graph_get_length_matrix(graph);
74 buf = calloc(n * 20, sizeof(char));
75 for (i = 0; i < n; i++) {
76 for (j = 0; j < n; j++) {
77 sprintf(buf + strlen(buf), "%le\t", adj[i * n + j]);
86 if (test_shortest_paths) {
88 xbt_node_t *route = NULL;
90 INFO0("---- Testing Shortest Paths ----");
91 route = xbt_graph_shortest_paths(graph);
92 buf = calloc(n * 40, sizeof(char));
93 for (i = 0; i < n; i++) {
94 for (j = 0; j < n; j++) {
96 snprintf(buf+strlen(buf), 40, "%s\t",
97 node_name(route[i * n + j]));
106 if (test_topo_sort) {
107 xbt_node_t *sorted = NULL;
109 INFO0("---- Testing Topological Sort ----");
110 sorted = xbt_graph_topo_sort(graph);
111 for (i = 0; i < n; i++) {
113 INFO3("sorted[%d] = %s (%p)", i, node_name(sorted[i]), sorted[i]);
120 if (test_node_deletion) {
121 INFO0("---- Testing Node Deletion ----");
122 nodes = xbt_graph_get_nodes(graph);
123 edges = xbt_graph_get_edges(graph);
124 INFO2("Before Node deletion: %lu nodes, %lu edges",
125 xbt_dynar_length(nodes), xbt_dynar_length(edges));
127 while (xbt_dynar_length(nodes))
128 xbt_graph_free_node(graph,
129 *((xbt_node_t *) xbt_dynar_get_ptr(nodes, 0)),
131 INFO2("After Node deletion: %lu nodes, %lu edges",
132 xbt_dynar_length(nodes), xbt_dynar_length(edges));
135 if (test_edge_deletion) {
136 INFO0("---- Testing Edge Deletion ----");
137 nodes = xbt_graph_get_nodes(graph);
138 edges = xbt_graph_get_edges(graph);
139 INFO2("Before Edge deletion: %lu nodes, %lu edges",
140 xbt_dynar_length(nodes), xbt_dynar_length(edges));
142 while (xbt_dynar_length(edges))
143 xbt_graph_free_edge(graph,
144 *((xbt_edge_t *) xbt_dynar_get_ptr(edges, 0)),
147 INFO2("After Edge deletion: %lu nodes, %lu edges",
148 xbt_dynar_length(nodes), xbt_dynar_length(edges));
151 xbt_graph_free_graph(graph, free_label, NULL, NULL);
158 int main(int argc, char **argv) {
159 xbt_init(&argc, argv);
161 fprintf(stderr, "Usage : %s graph.xml\n", argv[0]);