3 /* Copyright (c) 2006 Darina Dimitrova, Arnaud Legrand.
4 All rights reserved. */
6 /* This program is free software; you can redistribute it and/or modify it
7 * under the terms of the license (GNU LGPL) which comes with this package. */
11 #include "xbt/misc.h" /* SG_BEGIN_DECL */
12 #include "xbt/dynar.h"
15 /** @addtogroup XBT_graph
16 * @brief A graph data type with several interesting algorithms
21 typedef struct xbt_node *xbt_node_t;
22 typedef struct xbt_edge *xbt_edge_t;
23 typedef struct xbt_graph *xbt_graph_t;
26 XBT_PUBLIC(xbt_graph_t) xbt_graph_new_graph(unsigned short int directed, void *data);
27 XBT_PUBLIC(xbt_node_t) xbt_graph_new_node(xbt_graph_t g, void *data);
28 XBT_PUBLIC(xbt_edge_t) xbt_graph_new_edge(xbt_graph_t g, xbt_node_t src, xbt_node_t dst,
30 XBT_PUBLIC(void*) xbt_graph_node_get_data(xbt_node_t node);
31 XBT_PUBLIC(void) xbt_graph_node_set_data(xbt_node_t node, void *data);
32 XBT_PUBLIC(void*) xbt_graph_edge_get_data(xbt_edge_t edge);
33 XBT_PUBLIC(void) xbt_graph_edge_set_data(xbt_edge_t edge, void *data);
35 XBT_PUBLIC(xbt_edge_t) xbt_graph_get_edge(xbt_graph_t g, xbt_node_t src, xbt_node_t dst);
37 XBT_PUBLIC(void) xbt_graph_edge_set_length(xbt_edge_t e, double length);
38 XBT_PUBLIC(double) xbt_graph_edge_get_length(xbt_edge_t e);
39 XBT_PUBLIC(double*) xbt_graph_get_length_matrix(xbt_graph_t g);
41 XBT_PUBLIC(void) xbt_graph_free_node(xbt_graph_t g, xbt_node_t n,
42 void_f_pvoid_t *node_free_function , void_f_pvoid_t *edge_free_function);
43 XBT_PUBLIC(void) xbt_graph_free_edge(xbt_graph_t g, xbt_edge_t e,
44 void_f_pvoid_t *free_function);
45 XBT_PUBLIC(void) xbt_graph_free_graph(xbt_graph_t g,
46 void_f_pvoid_t *node_free_function,
47 void_f_pvoid_t *edge_free_function,
48 void_f_pvoid_t *graph_free_function);
50 XBT_PUBLIC(int) __xbt_find_in_dynar(xbt_dynar_t dynar, void *p);
52 XBT_PUBLIC(xbt_dynar_t) xbt_graph_get_nodes(xbt_graph_t g);
53 XBT_PUBLIC(xbt_dynar_t) xbt_graph_get_edges(xbt_graph_t g);
54 XBT_PUBLIC(xbt_node_t) xbt_graph_edge_get_source(xbt_edge_t e);
55 XBT_PUBLIC(xbt_node_t) xbt_graph_edge_get_target(xbt_edge_t e);
56 XBT_PUBLIC(xbt_graph_t) xbt_graph_read(const char *filename,
57 void *(node_label_and_data)(xbt_node_t, const char*, const char*),
58 void *(edge_label_and_data)(xbt_edge_t, const char*, const char*)
61 XBT_PUBLIC(void) xbt_graph_export_graphviz(xbt_graph_t g, const char *filename,
62 const char *(node_name)(xbt_node_t),
63 const char *(edge_name)(xbt_edge_t));
64 XBT_PUBLIC(void) xbt_graph_export_graphxml(xbt_graph_t g, const char *filename,
65 const char *(node_name)(xbt_node_t),
66 const char *(edge_name)(xbt_edge_t),
67 const char *(node_data_print)(void *),
68 const char *(edge_data_print)(void *));
70 /* Not implemented yet ! */
71 /* void *xbt_graph_to_array(xbt_graph_t g); */
72 XBT_PUBLIC(xbt_node_t*) xbt_graph_shortest_paths(xbt_graph_t g);
76 /** @brief transforms the network structure of a directed acyclic graph given into a linear structure
77 @return: an array containing the nodes of the graph sorted in order reverse to the path of exploration
78 if a cycle is detected an exception is raised
81 XBT_PUBLIC(xbt_node_t*) xbt_graph_topo_sort(xbt_graph_t g);
83 XBT_PUBLIC(xbt_edge_t*) xbt_graph_spanning_tree_prim(xbt_graph_t g);
88 /** Convenient for loop : g is a graph, n a node, e an edge, b a bucket and i an item **/
90 /* #define xbt_graph_foreachInNeighbor(v,n,i) \ */
91 /* for(i=xbt_fifo_get_first_item((v)->in); \ */
92 /* ((i)?(n=((xbt_edge_t)((xbt_fifo_get_item_content(i)) */
93 /* )->src):(NULL));\ */
94 /* i=xbt_fifo_get_next_item(i)) */
95 /* #define xbt_graph_foreachOutNeighbor(v,n,i) \ */
96 /* for(i=xbt_fifo_get_first_item((v)->out); \ */
97 /* ((i)?(n=((xbt_edge_t)(xbt_fifo_get_item_content(i)))->dst):(NULL));\ */
98 /* i=xbt_fifo_get_next_item(i)) */
104 #endif /* _XBT_GRAPH_H */