X-Git-Url: http://info.iut-bm.univ-fcomte.fr/pub/gitweb/simgrid.git/blobdiff_plain/4e78565ea6b354a0e6250a87b483f909665a0ac3..05ac54fdc9965fd0ba06ee3a036d8cf212608e89:/src/xbt/graph.c diff --git a/src/xbt/graph.c b/src/xbt/graph.c index 2c6603b621..42c211f3bd 100644 --- a/src/xbt/graph.c +++ b/src/xbt/graph.c @@ -1,36 +1,31 @@ /* a generic graph library. */ -/* Copyright (c) 2006, 2007, 2008, 2009, 2010. The SimGrid Team. +/* Copyright (c) 2006-2014. The SimGrid Team. * 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 -#include #include "xbt/sysdep.h" #include "xbt/log.h" #include "xbt/graph.h" #include "graph_private.h" -#include "xbt/graphxml_parse.h" #include "xbt/dict.h" #include "xbt/heap.h" #include "xbt/str.h" +#include "xbt/file.h" - - +#include +#include XBT_LOG_NEW_DEFAULT_SUBCATEGORY(xbt_graph, xbt, "Graph"); - - /** @brief Constructor * @return a new graph */ xbt_graph_t xbt_graph_new_graph(unsigned short int directed, void *data) { - xbt_graph_t graph = NULL; - graph = xbt_new0(struct xbt_graph, 1); + xbt_graph_t graph = xbt_new0(struct xbt_graph, 1); graph->directed = directed; graph->data = data; graph->nodes = xbt_dynar_new(sizeof(xbt_node_t), NULL); @@ -42,8 +37,7 @@ xbt_graph_t xbt_graph_new_graph(unsigned short int directed, void *data) /** @brief add a node to the given graph */ xbt_node_t xbt_graph_new_node(xbt_graph_t g, void *data) { - xbt_node_t node = NULL; - node = xbt_new0(struct xbt_node, 1); + xbt_node_t node= xbt_new0(struct xbt_node, 1); node->data = data; if (g->directed) /* only the "out" field is used */ @@ -59,12 +53,9 @@ xbt_node_t xbt_graph_new_node(xbt_graph_t g, void *data) } /** @brief add an edge to the given graph */ -xbt_edge_t xbt_graph_new_edge(xbt_graph_t g, - xbt_node_t src, xbt_node_t dst, void *data) +xbt_edge_t xbt_graph_new_edge(xbt_graph_t g, xbt_node_t src, xbt_node_t dst, void *data) { - xbt_edge_t edge = NULL; - - edge = xbt_new0(struct xbt_edge, 1); + xbt_edge_t edge = xbt_new0(struct xbt_edge, 1); xbt_dynar_push(src->out, &edge); if (g->directed) xbt_dynar_push(dst->in, &edge); @@ -81,8 +72,7 @@ xbt_edge_t xbt_graph_new_edge(xbt_graph_t g, } /** @brief Get the edge connecting src and dst */ -xbt_edge_t xbt_graph_get_edge(xbt_graph_t g, xbt_node_t src, - xbt_node_t dst) +xbt_edge_t xbt_graph_get_edge(xbt_graph_t g, xbt_node_t src, xbt_node_t dst) { xbt_edge_t edge; unsigned int cursor; @@ -134,9 +124,7 @@ void xbt_graph_edge_set_data(xbt_edge_t edge, void *data) * * Free the graph structure. */ -void xbt_graph_free_graph(xbt_graph_t g, - void_f_pvoid_t node_free_function, - void_f_pvoid_t edge_free_function, +void xbt_graph_free_graph(xbt_graph_t g, void_f_pvoid_t node_free_function, void_f_pvoid_t edge_free_function, void_f_pvoid_t graph_free_function) { unsigned int cursor; @@ -162,90 +150,6 @@ void xbt_graph_free_graph(xbt_graph_t g, if (graph_free_function) graph_free_function(g->data); free(g); - xbt_graph_parse_lex_destroy(); -} - - -/** @brief remove the given node from the given graph */ -void xbt_graph_free_node(xbt_graph_t g, xbt_node_t n, - void_f_pvoid_t node_free_function, - void_f_pvoid_t edge_free_function) -{ - unsigned long nbr; - unsigned long i; - unsigned int cursor = 0; - xbt_node_t node = NULL; - xbt_edge_t edge = NULL; - - nbr = xbt_dynar_length(g->edges); - cursor = 0; - for (i = 0; i < nbr; i++) { - xbt_dynar_get_cpy(g->edges, cursor, &edge); - - if ((edge->dst == n) || (edge->src == n)) { - xbt_graph_free_edge(g, edge, edge_free_function); - } else - cursor++; - } - - if ((node_free_function) && (n->data)) - node_free_function(n->data); - - cursor = 0; - xbt_dynar_foreach(g->nodes, cursor, node) - if (node == n) - xbt_dynar_cursor_rm(g->nodes, &cursor); - - xbt_dynar_free(&(n->in)); - xbt_dynar_free(&(n->out)); - - free(n); - - return; -} - -/** @brief remove the given edge from the given graph */ -void xbt_graph_free_edge(xbt_graph_t g, xbt_edge_t e, - void_f_pvoid_t free_function) -{ - int idx; - unsigned int cursor = 0; - xbt_edge_t edge = NULL; - - if ((free_function) && (e->data)) - free_function(e->data); - - xbt_dynar_foreach(g->edges, cursor, edge) { - if (edge == e) { - 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); - - xbt_dynar_cursor_rm(g->edges, &cursor); - free(edge); - break; - } - } -} - -int __xbt_find_in_dynar(xbt_dynar_t dynar, void *p) -{ - - unsigned int cursor = 0; - void *tmp = NULL; - - xbt_dynar_foreach(dynar, cursor, tmp) { - if (tmp == p) - return cursor; - } - return -1; } /** @brief Retrieve the graph's nodes as a dynar */ @@ -291,79 +195,31 @@ double xbt_graph_edge_get_length(xbt_edge_t edge) return edge->length; } - -/** @brief construct the adjacency matrix corresponding to the given graph - * - * The weights are the distances between nodes - */ -double *xbt_graph_get_length_matrix(xbt_graph_t g) -{ - unsigned int cursor = 0; - unsigned int in_cursor = 0; - unsigned long 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; -} - /** @brief Floyd-Warshall algorithm for shortest path finding * * From wikipedia: * - * The Floyd–Warshall algorithm takes as input an adjacency matrix - * representation of a weighted, directed graph (V, E). The weight of a - * path between two vertices is the sum of the weights of the edges along - * that path. The edges E of the graph may have negative weights, but the - * graph must not have any negative weight cycles. The algorithm computes, - * for each pair of vertices, the minimum weight among all paths between - * the two vertices. The running time complexity is Θ(|V|3). + * The Floyd-Warshall algorithm takes as input an adjacency matrix representation of a weighted, directed graph (V, E). + * The weight of a path between two vertices is the sum of the weights of the edges along that path. The edges E of the + * graph may have negative weights, but the graph must not have any negative weight cycles. The algorithm computes, for + * each pair of vertices, the minimum weight among all paths between the two vertices. The running time complexity is + * Θ(|V|3). */ -void xbt_floyd_algorithm(xbt_graph_t g, double *adj, double *d, - xbt_node_t * p) +void xbt_floyd_algorithm(xbt_graph_t g, double *adj, double *d, xbt_node_t * p) { - unsigned long 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)] + unsigned long i; + unsigned long j; + unsigned long k; + unsigned long n = xbt_dynar_length(g->nodes); 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)); + if (d[i*n+j] > -1) { + p[i*n+j] = *((xbt_node_t *) xbt_dynar_get_ptr(g->nodes, i)); } } } @@ -371,285 +227,27 @@ void xbt_floyd_algorithm(xbt_graph_t g, double *adj, double *d, 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); + if ((d[i*n+k] > -1) && (d[k*n+j] > -1)) { + if ((d[i*n+j] < 0) || (d[i*n+j] > d[i*n+k] + d[k*n+j])) { + d[i*n+j] = d[i*n+k] + d[k*n+j]; + p[i*n+j] = p[k*n+j]; } } } } } - - - -# undef P -# undef D -} - -/** @brief computes all-pairs shortest paths */ -xbt_node_t *xbt_graph_shortest_paths(xbt_graph_t g) -{ - xbt_node_t *p; - xbt_node_t *r; - unsigned long 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; -} - -/** @brief Extract a spanning tree of the given graph */ -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); - unsigned int cursor; - - xbt_assert(!(g->directed), - "Spanning trees do not make sense on directed graphs"); - - xbt_dynar_foreach(g->nodes, cursor, node) { - node->xbtdata = NULL; - } - - 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); - - return tree; -} - -/** @brief Topological sort on the given graph - * - * From wikipedia: - * - * In graph theory, a topological sort of a directed acyclic graph (DAG) is - * a linear ordering of its nodes which is compatible with the partial - * order R induced on the nodes where x comes before y (xRy) if there's a - * directed path from x to y in the DAG. An equivalent definition is that - * each node comes before all nodes to which it has edges. Every DAG has at - * least one topological sort, and may have many. - */ -xbt_node_t *xbt_graph_topo_sort(xbt_graph_t g) -{ - - xbt_node_t *sorted; - unsigned int cursor; - int idx; - xbt_node_t node; - unsigned long n; - - n = xbt_dynar_length(g->nodes); - idx = n - 1; - - sorted = xbt_malloc(n * sizeof(xbt_node_t)); - - xbt_dynar_foreach(g->nodes, cursor, node) - node->xbtdata = xbt_new0(int, 1); - - xbt_dynar_foreach(g->nodes, cursor, node) - xbt_graph_depth_visit(g, node, sorted, &idx); - - xbt_dynar_foreach(g->nodes, cursor, node) { - free(node->xbtdata); - node->xbtdata = NULL; - } - - return sorted; -} - -/** @brief First-depth graph traversal */ -void xbt_graph_depth_visit(xbt_graph_t g, xbt_node_t n, - xbt_node_t * sorted, int *idx) -{ - unsigned int cursor; - xbt_edge_t edge; - - if (*((int *) (n->xbtdata)) == ALREADY_EXPLORED) - return; - else if (*((int *) (n->xbtdata)) == CURRENTLY_EXPLORING) - THROWF(0, 0, "There is a cycle"); - else { - *((int *) (n->xbtdata)) = CURRENTLY_EXPLORING; - - xbt_dynar_foreach(n->out, cursor, edge) { - xbt_graph_depth_visit(g, edge->dst, sorted, idx); - } - - *((int *) (n->xbtdata)) = ALREADY_EXPLORED; - sorted[(*idx)--] = n; - } -} - -/********************* Import and Export ******************/ -static xbt_graph_t parsed_graph = NULL; -static xbt_dict_t parsed_nodes = 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) -{ - XBT_DEBUG(""); - 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_homogeneous(NULL); -} - -static void __parse_graph_end(void) -{ - xbt_dict_free(&parsed_nodes); - XBT_DEBUG(""); -} - -static void __parse_node(void) -{ - xbt_node_t node = xbt_graph_new_node(parsed_graph, NULL); - - XBT_DEBUG("", 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); - node->position_x = xbt_graph_parse_get_double(A_graphxml_node_position___x); - node->position_y = xbt_graph_parse_get_double(A_graphxml_node_position___y); - - 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), - NULL); - - if (__parse_edge_label_and_data) - edge->data = __parse_edge_label_and_data(edge, A_graphxml_edge_label, - A_graphxml_edge_data); - - edge->length = xbt_graph_parse_get_double(A_graphxml_edge_length); - - XBT_DEBUG("", - (char *) (edge->src)->data, - (char *) (edge->dst)->data, xbt_graph_edge_get_length(edge)); -} - -/** @brief Import a graph from a file following the GraphXML format */ -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 = NULL; - - __parse_node_label_and_data = node_label_and_data; - __parse_edge_label_and_data = edge_label_and_data; - - 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_GNUC_UNUSED int res; - res = xbt_graph_parse(); - xbt_assert(!res, "Parse error in %s", filename); - xbt_graph_parse_close(); - - graph = parsed_graph; - parsed_graph = NULL; - - return graph; } /** @brief Export the given graph in the GraphViz formatting for visualization */ -void xbt_graph_export_graphviz(xbt_graph_t g, const char *filename, - const char *(node_name) (xbt_node_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)) { unsigned int cursor = 0; xbt_node_t node = NULL; xbt_edge_t edge = NULL; - FILE *file = NULL; const char *name = NULL; - file = fopen(filename, "w"); + FILE *file = fopen(filename, "w"); xbt_assert(file, "Failed to open %s \n", filename); if (g->directed) @@ -660,8 +258,7 @@ void xbt_graph_export_graphviz(xbt_graph_t g, const char *filename, 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"); + fprintf(file, " node [width=.3, height=.3, style=filled, color=skyblue]\n\n"); xbt_dynar_foreach(g->nodes, cursor, node) { if (node_name){ @@ -679,170 +276,21 @@ void xbt_graph_export_graphviz(xbt_graph_t g, const char *filename, }else{ c = c_ndir; } - const char *src_name, *dst_name; if (node_name){ - src_name = node_name(edge->src); - dst_name = node_name(edge->dst); + const char *src_name = node_name(edge->src); + const char *dst_name = node_name(edge->dst); fprintf(file, " \"%s\" %s \"%s\"", src_name, c, dst_name); }else{ fprintf(file, " \"%p\" %s \"%p\"", edge->src, c, edge->dst); } - if ((edge_name) && ((name = edge_name(edge)))) - fprintf(file, "[label=\"%s\"]", name); + if (edge_name){ + name = edge_name(edge); + if (name) + fprintf(file, "[label=\"%s\"]", name); + } fprintf(file, ";\n"); } fprintf(file, "}\n"); fclose(file); } - -/** @brief Export the given graph in the GraphXML format */ -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 *)) -{ - unsigned 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_assert(file, "Failed to open %s \n", filename); - - fprintf(file, "\n"); - fprintf(file, "\n"); - if (g->directed) - fprintf(file, "\n"); - else - fprintf(file, "\n"); - xbt_dynar_foreach(g->nodes, cursor, node) { - fprintf(file, " data)))) - fprintf(file, "data=\"%s\" ", name); - fprintf(file, ">\n"); - } - xbt_dynar_foreach(g->edges, cursor, edge) { - fprintf(file, " 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, "\n"); - fclose(file); -} - -/** @brief Load a graph from a file (in the SimGrid Graph format) */ -xbt_graph_t xbt_graph_load (const char *filename) -{ - FILE *file = NULL; - ssize_t read; - file = fopen (filename, "r"); - xbt_assert(file, "Failed to open %s \n", filename); - - xbt_dict_t nodes_dict = xbt_dict_new_homogeneous(NULL); - xbt_graph_t ret = xbt_graph_new_graph (0, NULL); - - //read the number of nodes - size_t size; - char *nnodes_str = NULL; - read = xbt_getline (&nnodes_str, &size, file); - if (read == -1) - THROWF(system_error, 0, "xbt_getline failed to read the number of nodes (errno = %d)", errno); - int i, nnodes = atoi (nnodes_str); - free (nnodes_str); - - //read all nodes - for (i = 0; i < nnodes; i++){ - char *node_str = NULL; - read = xbt_getline (&node_str, &size, file); - if (read == -1) - THROWF(system_error, 0, "xbt_getline failed to read all nodes (errno = %d)", errno); - xbt_node_t n; - char *name = xbt_strdup (node_str); - xbt_str_subst (name, '\n', '\0', 0); - n = xbt_graph_new_node (ret, name); - xbt_dict_set (nodes_dict, name, n, NULL); - free (node_str); - } - - //read the number of edges - char *nedges_str = NULL; - read = xbt_getline (&nedges_str, &size, file); - if (read == -1) - THROWF(system_error, 0, "xbt_getline failed to read the number of edges (errno = %d)", errno); - int nedges = atoi (nedges_str); - free (nedges_str); - - //read all edges - for (i = 0; i < nedges; i++){ - char *edge_str = NULL, edge_id[200], node_source[200], node_target[200]; - read = xbt_getline (&edge_str, &size, file); - if (read == -1) - THROWF(system_error, 0, "xbt_getline failed to read all edges (errno = %d)", errno); - sscanf (edge_str, "%s %s %s", edge_id, node_source, node_target); - free (edge_str); - xbt_str_subst (edge_id, '\n', '\0', 0); - xbt_str_subst (node_source, '\n', '\0', 0); - xbt_str_subst (node_target, '\n', '\0', 0); - - xbt_node_t source = xbt_dict_get (nodes_dict, node_source); - xbt_node_t target = xbt_dict_get (nodes_dict, node_target); - xbt_graph_new_edge (ret, source, target, xbt_strdup(edge_id)); - } - xbt_dict_free (&nodes_dict); - return ret; -} - -/** @brief Save a graph from a file (in the SimGrid Graph format) */ -void xbt_graph_save (xbt_graph_t span, - const char *filename, - const char *(nname) (xbt_node_t), - const char *(ename) (xbt_edge_t)) -{ - FILE *file = NULL; - file = fopen(filename, "w"); - xbt_assert(file, "Failed to open %s \n", filename); - - xbt_dynar_t nodes = xbt_graph_get_nodes (span); - xbt_dynar_t edges = xbt_graph_get_edges (span); - unsigned int cpt; - xbt_node_t node; - fprintf (file, "%lu\n", xbt_dynar_length (nodes)); - xbt_dynar_foreach (nodes, cpt, node) { - if (nname){ - fprintf (file, "%s\n", nname(node)); - }else{ - fprintf (file, "%p\n", node); - } - } - fprintf (file, "%lu\n", xbt_dynar_length (edges)); - xbt_edge_t edge; - xbt_dynar_foreach (edges, cpt, edge) { - xbt_node_t source = xbt_graph_edge_get_source (edge); - xbt_node_t target = xbt_graph_edge_get_target (edge); - if (ename){ - if (nname){ - fprintf (file, "%s %s %s\n", ename(edge), nname(source), nname(target)); - }else{ - fprintf (file, "%s %p %p\n", ename(edge), source, target); - } - }else{ - if (nname){ - fprintf (file, "%p %s %s\n", edge, nname(source), nname(target)); - }else{ - fprintf (file, "%p %p %p\n", edge, source, target); - } - } - } - fclose (file); -}