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. */
13 #include "xbt/module.h"
14 #include "xbt/sysdep.h"
15 #include "xbt/graph.h"
16 #include "xbt/graphxml.h"
19 XBT_LOG_NEW_DEFAULT_CATEGORY(test, "Logging specific to graphxml test");
22 static void *node_label_and_data(xbt_node_t node, const char *label,
25 char *lbl = xbt_strdup(label);
28 #define free_label free
30 static const char *node_name(xbt_node_t n)
32 return xbt_graph_node_get_data(n);
35 void test(char *graph_file);
36 void test(char *graph_file)
38 int test_node_deletion = 0;
39 int test_edge_deletion = 0;
40 int test_export_xml = 1;
41 int test_export_dot = 1;
42 int test_export_length = 1;
43 int test_shortest_paths = 1;
44 int test_topo_sort = 1;
49 xbt_dynar_t edges = NULL;
50 xbt_dynar_t nodes = NULL;
53 xbt_graph_read(graph_file, &node_label_and_data, NULL);
55 n = xbt_dynar_length(xbt_graph_get_nodes(graph));
57 if (test_export_xml) {
58 INFO0("---- Testing XML export. Exporting to testgraph.xml ----");
59 xbt_graph_export_graphxml(graph, "testgraph.xml", NULL, NULL, NULL,
62 if (test_export_dot) {
63 INFO0("---- Testing GraphViz export. Exporting to testgraph.dot ----");
64 xbt_graph_export_graphviz(graph, "testgraph.dot", node_name, NULL);
67 if (test_export_length) {
71 INFO0("---- Dumping Edge lengths ----");
72 adj = xbt_graph_get_length_matrix(graph);
73 buf = calloc(n * 20, sizeof(char));
74 for (i = 0; i < n; i++) {
75 for (j = 0; j < n; j++) {
76 sprintf(buf + strlen(buf), "%le\t", adj[i * n + j]);
85 if (test_shortest_paths) {
87 xbt_node_t *route = NULL;
89 INFO0("---- Testing Shortest Paths ----");
90 route = xbt_graph_shortest_paths(graph);
91 buf = calloc(n * 40, sizeof(char));
92 for (i = 0; i < n; i++) {
93 for (j = 0; j < n; j++) {
95 snprintf(buf+strlen(buf), 40, "%s\t",
96 node_name(route[i * n + j]));
105 if (test_topo_sort) {
106 xbt_node_t *sorted = NULL;
108 INFO0("---- Testing Topological Sort ----");
109 sorted = xbt_graph_topo_sort(graph);
110 for (i = 0; i < n; i++) {
112 INFO3("sorted[%d] = %s (%p)", i, node_name(sorted[i]), sorted[i]);
119 if (test_node_deletion) {
120 INFO0("---- Testing Node Deletion ----");
121 nodes = xbt_graph_get_nodes(graph);
122 edges = xbt_graph_get_edges(graph);
123 INFO2("Before Node deletion: %lu nodes, %lu edges",
124 xbt_dynar_length(nodes), xbt_dynar_length(edges));
126 while (xbt_dynar_length(nodes))
127 xbt_graph_free_node(graph,
128 *((xbt_node_t *) xbt_dynar_get_ptr(nodes, 0)),
130 INFO2("After Node deletion: %lu nodes, %lu edges",
131 xbt_dynar_length(nodes), xbt_dynar_length(edges));
134 if (test_edge_deletion) {
135 INFO0("---- Testing Edge Deletion ----");
136 nodes = xbt_graph_get_nodes(graph);
137 edges = xbt_graph_get_edges(graph);
138 INFO2("Before Edge deletion: %lu nodes, %lu edges",
139 xbt_dynar_length(nodes), xbt_dynar_length(edges));
141 while (xbt_dynar_length(edges))
142 xbt_graph_free_edge(graph,
143 *((xbt_edge_t *) xbt_dynar_get_ptr(edges, 0)),
146 INFO2("After Edge deletion: %lu nodes, %lu edges",
147 xbt_dynar_length(nodes), xbt_dynar_length(edges));
150 xbt_graph_free_graph(graph, free_label, NULL, NULL);
157 int main(int argc, char **argv) {
158 xbt_init(&argc, argv);
160 fprintf(stderr, "Usage : %s graph.xml\n", argv[0]);