-
-
-/*construct the adjacency matrix corresponding to a graph,
- the weights are the distances between nodes
- */
-double *xbt_graph_get_length_matrix(xbt_graph_t g)
-{
- int cursor = 0;
- int in_cursor = 0;
- int idx,i;
- unsigned long n;
- xbt_edge_t edge = NULL;
- xbt_node_t node=NULL;
- double *d = NULL;
-
-# define D(u,v) d[(u)*n+(v)]
- n = xbt_dynar_length(g->nodes);
-
- d = (double *) xbt_new0(double, n*n);
-
- for (i = 0; i < n * n; i++)
- {
- d[i] = -1.0;
- }
-
- xbt_dynar_foreach(g->nodes, cursor, node)
- {
- in_cursor = 0;
- D(cursor, cursor) = 0;
-
- xbt_dynar_foreach(node->out, in_cursor, edge)
- {
- if (edge->dst==node)
- idx= __xbt_find_in_dynar(g->nodes, edge->src);
- else /*case of undirected graphs*/
- idx = __xbt_find_in_dynar(g->nodes, edge->dst);
- D( cursor,idx) = edge->length;
- }
- }
-
-# undef D
-
- return d;
-}
-
-
-void xbt_floyd_algorithm(xbt_graph_t g, double *adj, double *d,
- xbt_node_t * p)
-{
- int i, j, k;
- unsigned long n;
- n = xbt_dynar_length(g->nodes);
-
-# define D(u,v) d[(u)*n+(v)]
-# define P(u,v) p[(u)*n+(v)]
-
- for (i = 0; i < n * n; i++)
- {
- d[i] = adj[i];
- }
-
-
- for (i = 0; i < n; i++)
- {
- for (j = 0; j < n; j++)
- {
- if (D(i, j) != -1)
- {
- P(i,j) =*((xbt_node_t*) xbt_dynar_get_ptr(g->nodes, i));
- }
- }
- }
-
- for (k = 0; k < n; k++)
- {
- for (i = 0; i < n; i++)
- {
- for (j = 0; j < n; j++)
- {
- if ((D(i, k) != -1) && (D(k, j) != -1))
- {
- if ((D(i, j) == -1) || (D(i, j) > D(i, k) + D(k, j)))
- {
- D(i, j) = D(i, k) + D(k, j);
- P(i, j) = P(k, j);
- }
- }
- }
- }
- }
-
-
-
-# undef P
-# undef D
-}
-
-/*computes all-pairs shortest paths*/
-xbt_node_t *xbt_graph_shortest_paths(xbt_graph_t g)
-{
- xbt_node_t *p;
- xbt_node_t *r;
- int i, j, k;
- unsigned long n;
-
- double *adj = NULL;
- double *d = NULL;
-
-# define P(u,v) p[(u)*n+(v)]
-# define R(u,v) r[(u)*n+(v)]
-
- n = xbt_dynar_length(g->nodes);
- adj = xbt_graph_get_length_matrix(g);
- d = xbt_new0(double,n*n);
- p = xbt_new0(xbt_node_t,n*n);
- r = xbt_new0(xbt_node_t,n*n);
-
- xbt_floyd_algorithm(g, adj, d, p);
-
- for (i = 0; i < n; i++)
- {
- for (j = 0; j < n; j++)
- {
- k = j;
-
- while ((P(i, k)) && (__xbt_find_in_dynar(g->nodes, P(i, k)) != i))
- {
- k = __xbt_find_in_dynar(g->nodes, P(i, k));
- }
-
- if (P(i, j))
- {
- R(i, j) = *((xbt_node_t*) xbt_dynar_get_ptr(g->nodes, k));
- }
- }
- }
-# undef R
-# undef P
-
- free(d);
- free(p);
- free(adj);
- return r;
-}
-
-
-static xbt_graph_t parsed_graph = NULL;
-static xbt_dict_t parsed_nodes = NULL;
-
-
-static void __parse_graph_begin(void)
-{
- DEBUG0("<graph>");
-}
-static void __parse_graph_end(void)
-{
- DEBUG0("</graph>");
-}
-
-static void __parse_node(void)
-{
- xbt_node_t node =
- xbt_graph_new_node(parsed_graph, (void *) A_graphxml_node_name);
-
- xbt_dict_set(parsed_nodes, A_graphxml_node_name, (void *) node, NULL);
-
- DEBUG1("<node label=\"%s\"/>", (char *) (node->data));
-}
-static void __parse_edge(void)
-{
- xbt_edge_t edge = xbt_graph_new_edge(parsed_graph,
- xbt_dict_get(parsed_nodes,
- A_graphxml_edge_source),
- xbt_dict_get(parsed_nodes,
- A_graphxml_edge_target),
- (void *) A_graphxml_edge_name);
-
- xbt_graph_edge_set_length(edge, atof(A_graphxml_edge_length));
-
- DEBUG4("<edge name=\"%s\" source=\"%s\" target=\"%s\" length=\"%f\"/>",
- (char *) edge->data,
- (char *) (edge->src)->data,
- (char *) (edge->dst)->data,
- xbt_graph_edge_get_length(edge));
-}
-
-xbt_graph_t xbt_graph_read(const char *filename)
-{
- xbt_graph_t graph = xbt_graph_new_graph(1, NULL);
-
- parsed_graph = graph;
- parsed_nodes = xbt_dict_new();
-
-
- xbt_graph_parse_reset_parser();
-
- STag_graphxml_graph_fun = __parse_graph_begin;
- ETag_graphxml_graph_fun = __parse_graph_end;
- ETag_graphxml_node_fun = __parse_node;
- ETag_graphxml_edge_fun = __parse_edge;
-
-
- xbt_graph_parse_open(filename);
- xbt_assert1((!xbt_graph_parse()), "Parse error in %s", filename);
- xbt_graph_parse_close();
-
- xbt_dict_free(&parsed_nodes);
-
- parsed_graph = NULL;
- return graph;
-}
-
-void xbt_graph_export_graphviz(xbt_graph_t g, const char *filename,
- const char *(node_name) (xbt_node_t),
- const char *(edge_name) (xbt_edge_t))
-{
- int cursor = 0;
- xbt_node_t node = NULL;
- xbt_edge_t edge = NULL;
- FILE *file = NULL;
- const char *name=NULL;
-
- file=fopen(filename,"w");
- xbt_assert1(file, "Failed to open %s \n",filename);
-
- fprintf(file,"graph test {\n");
- fprintf(file," graph [overlap=scale]\n");
-
- fprintf(file," node [shape=box, style=filled]\n");
- fprintf(file," node [width=.3, height=.3, style=filled, color=skyblue]\n\n");
-
- xbt_dynar_foreach(g->nodes, cursor, node) {
- fprintf(file," %p ", node);
- if((node_name)&&((name=node_name(node)))) fprintf(file,"[label=\"%s\"]",name);
- fprintf(file,";\n");
- }
- xbt_dynar_foreach(g->edges, cursor, edge) {
- fprintf(file," %p -- %p",edge->src, edge->dst);
- if((edge_name)&&((name=edge_name(edge)))) fprintf(file,"[label=\"%s\"]",name);
- fprintf(file,";\n");
- }
- fprintf(file,"}\n");
- fclose(file);
-}
-
-void xbt_graph_export_graphxml(xbt_graph_t g, const char *filename,
- const char *(node_name)(xbt_node_t),
- const char *(edge_name)(xbt_edge_t))
-{
- int cursor = 0;
- xbt_node_t node = NULL;
- xbt_edge_t edge = NULL;
- FILE *file = NULL;
- const char *name = NULL;
-
- file=fopen(filename,"w");
- xbt_assert1(file, "Failed to open %s \n",filename);
-
- fprintf(file,"<?xml version='1.0'?>\n");
- fprintf(file,"<!DOCTYPE graph SYSTEM \"graphxml.dtd\">\n");
- fprintf(file,"<graph>\n");
- xbt_dynar_foreach(g->nodes, cursor, node) {
- fprintf(file," <node name=\"%p\" ", node);
- if((node_name)&&((name=node_name(node)))) fprintf(file,"label=\"%s\" ",name);
- fprintf(file,">\n");
- }
- xbt_dynar_foreach(g->edges, cursor, edge) {
- fprintf(file," <edge source=\"%p\" target =\"%p\" ",
- edge->src, edge->dst );
- if((edge_name)&&((name=edge_name(edge)))) fprintf(file,"label=\"%s\" ",name);
- fprintf(file,">\n");
- }
- fprintf(file,"</graph>\n");
- fclose(file);
-}
-