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. */
16 #define snprintf _snprintf
19 #include "xbt/module.h"
20 #include "xbt/sysdep.h"
21 #include "xbt/graph.h"
22 #include "xbt/graphxml.h"
25 XBT_LOG_NEW_DEFAULT_CATEGORY(test, "Logging specific to graphxml test");
28 static void *node_label_and_data(xbt_node_t node, const char *label,
31 char *lbl = xbt_strdup(label);
35 #define free_label free
37 static const char *node_name(xbt_node_t n)
39 return xbt_graph_node_get_data(n);
42 void test(char *graph_file);
43 void test(char *graph_file)
45 int test_node_deletion = 0;
46 int test_edge_deletion = 0;
47 int test_export_xml = 1;
48 int test_export_dot = 1;
49 int test_export_length = 1;
50 int test_shortest_paths = 1;
51 int test_topo_sort = 1;
56 xbt_dynar_t edges = NULL;
57 xbt_dynar_t nodes = NULL;
59 xbt_graph_t graph = xbt_graph_read(graph_file, &node_label_and_data, NULL);
61 n = xbt_dynar_length(xbt_graph_get_nodes(graph));
63 if (test_export_xml) {
64 INFO0("---- Testing XML export. Exporting to testgraph.xml ----");
65 xbt_graph_export_graphxml(graph, "testgraph.xml", NULL, NULL, NULL, NULL);
67 if (test_export_dot) {
68 INFO0("---- Testing GraphViz export. Exporting to testgraph.dot ----");
69 xbt_graph_export_graphviz(graph, "testgraph.dot", node_name, NULL);
72 if (test_export_length) {
76 INFO0("---- Dumping Edge lengths ----");
77 adj = xbt_graph_get_length_matrix(graph);
78 buf = xbt_new0(char, n * 20);
79 for (i = 0; i < n; i++) {
80 for (j = 0; j < n; j++) {
81 sprintf(buf + strlen(buf), "%le\t", adj[i * n + j]);
90 if (test_shortest_paths) {
92 xbt_node_t *route = NULL;
94 INFO0("---- Testing Shortest Paths ----");
95 route = xbt_graph_shortest_paths(graph);
96 buf = xbt_new0(char, n * 40);
97 for (i = 0; i < n; i++) {
98 for (j = 0; j < n; j++) {
100 snprintf(buf + strlen(buf), 40, "%s\t",
101 node_name(route[i * n + j]));
110 if (test_topo_sort) {
111 xbt_node_t *sorted = NULL;
113 INFO0("---- Testing Topological Sort ----");
114 sorted = xbt_graph_topo_sort(graph);
115 for (i = 0; i < n; i++) {
117 INFO3("sorted[%lu] = %s (%p)", i, node_name(sorted[i]), sorted[i]);
124 if (test_node_deletion) {
125 INFO0("---- Testing Node Deletion ----");
126 nodes = xbt_graph_get_nodes(graph);
127 edges = xbt_graph_get_edges(graph);
128 INFO2("Before Node deletion: %lu nodes, %lu edges",
129 xbt_dynar_length(nodes), xbt_dynar_length(edges));
131 while (xbt_dynar_length(nodes))
132 xbt_graph_free_node(graph,
133 *((xbt_node_t *) xbt_dynar_get_ptr(nodes, 0)),
135 INFO2("After Node deletion: %lu nodes, %lu edges",
136 xbt_dynar_length(nodes), xbt_dynar_length(edges));
139 if (test_edge_deletion) {
140 INFO0("---- Testing Edge Deletion ----");
141 nodes = xbt_graph_get_nodes(graph);
142 edges = xbt_graph_get_edges(graph);
143 INFO2("Before Edge deletion: %lu nodes, %lu edges",
144 xbt_dynar_length(nodes), xbt_dynar_length(edges));
146 while (xbt_dynar_length(edges))
147 xbt_graph_free_edge(graph,
148 *((xbt_edge_t *) xbt_dynar_get_ptr(edges, 0)),
151 INFO2("After Edge deletion: %lu nodes, %lu edges",
152 xbt_dynar_length(nodes), xbt_dynar_length(edges));
155 xbt_graph_free_graph(graph, free_label, NULL, NULL);
162 int main(int argc, char **argv)
164 xbt_init(&argc, argv);
166 fprintf(stderr, "Usage : %s graph.xml\n", argv[0]);