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 ,const char* data);
18 void* node_label_and_data(xbt_node_t node,const char*label ,const char* data)
20 char* lbl=xbt_strdup(label);
23 void test(char *graph_file);
24 void test(char *graph_file)
28 xbt_dynar_t dynar=NULL;
29 xbt_dynar_t dynar1=NULL;
30 xbt_node_t* sorted=NULL;
31 xbt_node_t * route=NULL;
33 xbt_graph_t graph = xbt_graph_read(graph_file,&node_label_and_data,NULL);
34 n=xbt_dynar_length(xbt_graph_get_nodes( graph));
36 double *adj=xbt_graph_get_length_matrix(graph);
43 fprintf(stderr,"%le\t",adj[i*n+j] );
45 fprintf(stderr,"\n" );
49 route= xbt_graph_shortest_paths( graph);
51 /* for(i=0;i<n;i++) */
53 /* for(j=0;j<n;j++) */
55 /* if( route[i*n+j]) */
56 /* fprintf(stderr,"%s\t",(char*)(route[i*n+j])->data) ); */
58 /* fprintf(stderr,"\n" ); */
62 sorted= xbt_graph_topo_sort(graph);
67 /* fprintf(stderr,"sorted[%d] =%p\n",i,sorted[i] ); */
68 fprintf(stderr,"%s\t",
69 (char*)((sorted[i])->data)
72 fprintf(stderr,"\n" );}
75 /* while(xbt_dynar_length(dynar)) */
76 /* xbt_graph_free_node(graph,*((xbt_node_t*)xbt_dynar_get_ptr(dynar,0)),NULL,NULL); */
78 dynar = xbt_graph_get_edges(graph);
79 while(xbt_dynar_length(dynar))
80 xbt_graph_free_edge(graph,*((xbt_edge_t*)xbt_dynar_get_ptr(dynar,0)),NULL);
82 printf("%lu edges\n",xbt_dynar_length(dynar));
83 dynar1 = xbt_graph_get_nodes(graph);
84 printf("%lu nodes\n",xbt_dynar_length(dynar1));
87 xbt_graph_free_graph(graph, NULL, NULL, NULL);
90 int main(int argc, char** argv)
95 fprintf(stderr,"Usage : %s graph.xml\n",argv[0]);