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"
19 void test(char *graph_file);
20 void test(char *graph_file)
24 xbt_dynar_t dynar=NULL;
25 xbt_dynar_t dynar1=NULL;
26 xbt_node_t * route=NULL;
28 xbt_graph_t graph = xbt_graph_read(graph_file);
29 n=xbt_dynar_length(xbt_graph_get_nodes( graph));
31 double *adj=xbt_graph_get_length_matrix(graph);
38 fprintf(stderr,"%le\t",adj[i*n+j] );
40 fprintf(stderr,"\n" );
44 route= xbt_graph_shortest_paths( graph);
46 /* for(i=0;i<n;i++) */
48 /* for(j=0;j<n;j++) */
50 /* /\* fprintf(stderr,"%le\t",(char*)((r[i*n+j])->data) ); *\/ */
52 /* fprintf(stderr,"\n" ); */
59 /* while(xbt_dynar_length(dynar)) */
60 /* xbt_graph_free_node(graph,*((xbt_node_t*)xbt_dynar_get_ptr(dynar,0)),NULL,NULL); */
62 dynar = xbt_graph_get_edges(graph);
63 while(xbt_dynar_length(dynar))
64 xbt_graph_free_edge(graph,*((xbt_edge_t*)xbt_dynar_get_ptr(dynar,0)),NULL);
66 printf("%lu edges\n",xbt_dynar_length(dynar));
67 dynar1 = xbt_graph_get_nodes(graph);
68 printf("%lu nodes\n",xbt_dynar_length(dynar1));
70 xbt_graph_free_graph(graph, NULL, NULL, NULL);
73 int main(int argc, char** argv)
78 fprintf(stderr,"Usage : %s graph.xml\n",argv[0]);