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. */
11 #include <xbt/module.h>
12 #include "xbt/graph.h"
13 #include "xbt/graphxml.h"
14 #include "xbt/dynar.h"
15 #include "xbt/sysdep.h"
16 #include "../src/xbt/graph_private.h"
17 void *node_label_and_data(xbt_node_t node, const char *label,
19 void *node_label_and_data(xbt_node_t node, const char *label,
22 char *lbl = xbt_strdup(label);
26 static const char *node_name(xbt_node_t n)
31 void test(char *graph_file);
32 void test(char *graph_file)
36 xbt_dynar_t dynar = NULL;
37 xbt_dynar_t dynar1 = NULL;
38 xbt_node_t *sorted = NULL;
39 xbt_node_t *route = NULL;
42 xbt_graph_read(graph_file, &node_label_and_data, NULL);
44 n = xbt_dynar_length(xbt_graph_get_nodes(graph));
46 double *adj = xbt_graph_get_length_matrix(graph);
48 graph_export_graphxml(graph, "testgraph.xml", NULL, NULL, NULL, NULL);
49 xbt_graph_export_graphviz(graph, "graph.dot", node_name, NULL);
51 for (i = 0; i < n; i++) {
52 for (j = 0; j < n; j++) {
53 fprintf(stderr, "%le\t", adj[i * n + j]);
55 fprintf(stderr, "\n");
59 route = xbt_graph_shortest_paths(graph);
61 /* for(i=0;i<n;i++) */
63 /* for(j=0;j<n;j++) */
65 /* if( route[i*n+j]) */
66 /* fprintf(stderr,"%s\t",(char*)(route[i*n+j])->data) ); */
68 /* fprintf(stderr,"\n" ); */
72 sorted = xbt_graph_topo_sort(graph);
74 for (i = 0; i < n; i++) {
76 /* fprintf(stderr,"sorted[%d] =%p\n",i,sorted[i] ); */
77 fprintf(stderr, "%s\t", (char *) ((sorted[i])->data)
80 fprintf(stderr, "\n");
84 /* while(xbt_dynar_length(dynar)) */
85 /* xbt_graph_free_node(graph,*((xbt_node_t*)xbt_dynar_get_ptr(dynar,0)),NULL,NULL); */
87 dynar = xbt_graph_get_edges(graph);
88 while (xbt_dynar_length(dynar))
89 xbt_graph_free_edge(graph,
90 *((xbt_edge_t *) xbt_dynar_get_ptr(dynar, 0)),
93 printf("%lu edges\n", xbt_dynar_length(dynar));
94 dynar1 = xbt_graph_get_nodes(graph);
95 printf("%lu nodes\n", xbt_dynar_length(dynar1));
99 xbt_graph_free_graph(graph, NULL, NULL, NULL);
102 int main(int argc, char **argv)
104 xbt_init(&argc, argv);
106 fprintf(stderr, "Usage : %s graph.xml\n", argv[0]);