-
-
-
/* $Id$ */
-
/* a generic graph library. */
-/* Copyright (c) 2006 Darina Dimitrova, Arnaud Legrand.
- All rights reserved. */
+/* Copyright (c) 2006 Darina Dimitrova, Arnaud Legrand. */
+/* All rights reserved. */
/* This program is free software; you can redistribute it and/or modify it
* under the terms of the license (GNU LGPL) which comes with this package. */
#include "graph_private.h"
#include "xbt/graphxml_parse.h"
#include "xbt/dict.h"
+#include "xbt/heap.h"
XBT_LOG_NEW_DEFAULT_SUBCATEGORY(graph, xbt, "Graph");
node->data = data;
node->in = xbt_dynar_new(sizeof(xbt_node_t), NULL);
node->out = xbt_dynar_new(sizeof(xbt_node_t), NULL);
+ node->position_x = -1.0;
+ node->position_y = -1.0;
xbt_dynar_push(g->nodes, &node);
return node;
edge = xbt_new0(struct xbt_edge, 1);
xbt_dynar_push(src->out, &edge);
- xbt_dynar_push(dst->in, &edge);
+ if (g->directed)
+ xbt_dynar_push(dst->in, &edge);
+ else /* only the "out" field is used */
+ xbt_dynar_push(dst->out, &edge);
edge->data = data;
edge->src = src;
edge->dst = dst;
- if (!g->directed)
- {
- xbt_dynar_push(src->in, &edge);
- xbt_dynar_push(dst->out, &edge);
- }
xbt_dynar_push(g->edges, &edge);
xbt_dynar_cursor_rm(g->nodes, &cursor);
}
+
return;
}
{
if (edge == e)
{
- idx = __xbt_find_in_dynar(edge->dst->in,edge);
- xbt_dynar_remove_at(edge->dst->in, idx,NULL);
+ if (g->directed) {
+ idx = __xbt_find_in_dynar(edge->dst->in,edge);
+ xbt_dynar_remove_at(edge->dst->in, idx,NULL);
+ } else { /* only the out field is used */
+ idx = __xbt_find_in_dynar(edge->dst->out,edge);
+ xbt_dynar_remove_at(edge->dst->out, idx,NULL);
+ }
+
idx = __xbt_find_in_dynar(edge->src->out,edge);
xbt_dynar_remove_at(edge->src->out,idx,NULL);
- if (!g->directed)
- {
- idx = __xbt_find_in_dynar(edge->src->in,edge);
- xbt_dynar_remove_at(edge->src->in,idx,NULL);
- idx = __xbt_find_in_dynar(edge->dst->out,edge);
- xbt_dynar_remove_at(edge->dst->out,idx,NULL);
- }
+
xbt_dynar_cursor_rm(g->edges, &cursor);
+ free(edge);
break;
}
}
# define D(u,v) d[(u)*n+(v)]
n = xbt_dynar_length(g->nodes);
- d = (double *) xbt_malloc(n * n * (sizeof(double)));
+ d = (double *) xbt_new0(double, n*n);
for (i = 0; i < n * n; i++)
{
n = xbt_dynar_length(g->nodes);
adj = xbt_graph_get_length_matrix(g);
- d = xbt_malloc(n*n*sizeof(double));
- p = xbt_malloc(n*n*sizeof(xbt_node_t));
- r = xbt_malloc(n*n*sizeof(xbt_node_t));
+ 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);
# undef R
# undef P
- xbt_free(d);
- xbt_free(p);
+ free(d);
+ free(p);
+ free(adj);
return r;
}
+xbt_edge_t* xbt_graph_spanning_tree_prim(xbt_graph_t g)
+{
+ int tree_size=0;
+ int tree_size_max=xbt_dynar_length(g->nodes)-1;
+ xbt_edge_t *tree = xbt_new0(xbt_edge_t,tree_size_max);
+ xbt_edge_t e,edge;
+ xbt_node_t node = NULL;
+ xbt_dynar_t edge_list = NULL;
+ xbt_heap_t heap = xbt_heap_new(10,NULL);
+ int cursor;
+
+ xbt_assert0(!(g->directed),
+ "Spanning trees do not make sense on directed graphs");
+
+ node = xbt_dynar_getfirst_as(g->nodes,xbt_node_t);
+ node->xbtdata = (void*) 1;
+ edge_list = node->out;
+ xbt_dynar_foreach(edge_list, cursor, e)
+ xbt_heap_push(heap,e, -(e->length));
+
+ while((edge=xbt_heap_pop(heap))) {
+ if((edge->src->xbtdata) && (edge->dst->xbtdata)) continue;
+ tree[tree_size++]=edge;
+ if(!(edge->src->xbtdata)) {
+ edge->src->xbtdata = (void*) 1;
+ edge_list = edge->src->out;
+ xbt_dynar_foreach(edge_list, cursor, e) {
+ xbt_heap_push(heap,e, -(e->length));
+ }
+ } else {
+ edge->dst->xbtdata = (void*) 1;
+ edge_list = edge->dst->out;
+ xbt_dynar_foreach(edge_list, cursor, e) {
+ xbt_heap_push(heap,e, -(e->length));
+ }
+ }
+ if(tree_size==tree_size_max) break;
+ }
+
+ xbt_heap_free(heap);
+
+ xbt_dynar_foreach(g->nodes, cursor, node) {
+ node->xbtdata = NULL;
+ }
+ return tree;
+}
+
+/********************* Import and Export ******************/
static xbt_graph_t parsed_graph = NULL;
static xbt_dict_t parsed_nodes = NULL;
-static xbt_dict_t parsed_edges = NULL;
+static void *(*__parse_node_label_and_data)(xbt_node_t, const char*, const char*) = NULL;
+static void *(*__parse_edge_label_and_data)(xbt_edge_t, const char*, const char*) = NULL;
static void __parse_graph_begin(void)
{
+
DEBUG0("<graph>");
+ if(A_graphxml_graph_isDirected == A_graphxml_graph_isDirected_true)
+ parsed_graph = xbt_graph_new_graph(1, NULL);
+ else parsed_graph = xbt_graph_new_graph(0, NULL);
+
+ parsed_nodes = xbt_dict_new();
}
static void __parse_graph_end(void)
{
+ xbt_dict_free(&parsed_nodes);
DEBUG0("</graph>");
}
static void __parse_node(void)
{
xbt_node_t node =
- xbt_graph_new_node(parsed_graph, (void *) A_graphxml_node_name);
+ xbt_graph_new_node(parsed_graph, NULL);
- xbt_dict_set(parsed_nodes, A_graphxml_node_name, (void *) node, NULL);
+ DEBUG1("<node name=\"%s\"/>", A_graphxml_node_name);
+ if(__parse_node_label_and_data)
+ node->data = __parse_node_label_and_data(node,A_graphxml_node_label,
+ A_graphxml_node_data);
+ xbt_graph_parse_get_double(&(node->position_x),A_graphxml_node_position_x);
+ xbt_graph_parse_get_double(&(node->position_y),A_graphxml_node_position_y);
- DEBUG1("<node label=\"%s\"/>", (char *) (node->data));
+ xbt_dict_set(parsed_nodes, A_graphxml_node_name, (void *) node, NULL);
}
+
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_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),
+ NULL);
- xbt_dict_set(parsed_edges, A_graphxml_edge_name, (void *) edge, NULL);
- xbt_graph_edge_set_length(edge, atof(A_graphxml_edge_length));
+ if(__parse_edge_label_and_data)
+ edge->data = __parse_edge_label_and_data(edge,A_graphxml_edge_label,
+ A_graphxml_edge_data);
+
+ xbt_graph_parse_get_double(&(edge->length),A_graphxml_edge_length);
DEBUG4("<edge name=\"%s\" source=\"%s\" target=\"%s\" length=\"%f\"/>",
(char *) edge->data,
xbt_graph_edge_get_length(edge));
}
-xbt_graph_t xbt_graph_read(const char *filename)
+xbt_graph_t xbt_graph_read(const char *filename,
+ void *(node_label_and_data)(xbt_node_t, const char*, const char*),
+ void *(edge_label_and_data)(xbt_edge_t, const char*, const char*))
{
- xbt_graph_t graph = xbt_graph_new_graph(1, NULL);
- parsed_graph = graph;
- parsed_nodes = xbt_dict_new();
- parsed_edges = xbt_dict_new();
+ xbt_graph_t graph = NULL;
+ __parse_node_label_and_data = node_label_and_data;
+ __parse_edge_label_and_data = edge_label_and_data;
xbt_graph_parse_reset_parser();
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);
- xbt_dict_free(&parsed_edges);
-
+ graph = parsed_graph;
parsed_graph = NULL;
+
return graph;
}
-void xbt_graph_export_surfxml(xbt_graph_t g,
- const char *filename,
- const char *(node_name) (xbt_node_t),
- const char *(edge_name) (xbt_edge_t)
- )
+
+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);
+
+ if(g->directed) fprintf(file,"digraph test {\n");
+ else 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) {
+ if(g->directed)
+ fprintf(file," \"%p\" -> \"%p\"",edge->src, edge->dst);
+ else
+ 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),
+ const char *(node_data_print)(void *),
+ const char *(edge_data_print)(void *))
+{
+ 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");
+ if(g->directed) fprintf(file,"<graph isDirected=\"true\">\n");
+ else fprintf(file,"<graph isDirected=\"false\">\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);
+ if((node_data_print)&&((name=node_data_print(node->data))))
+ fprintf(file,"data=\"%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);
+ if(edge->length>=0.0) fprintf(file,"length=\"%g\" ",edge->length);
+ if((edge_data_print)&&((name=edge_data_print(edge->data))))
+ fprintf(file,"data=\"%s\" ",name);
+ fprintf(file,">\n");
+ }
+ fprintf(file,"</graph>\n");
+ fclose(file);
}
