#include "xbt/dynar.h"
SG_BEGIN_DECL()
+ /** @addtogroup XBT_graph
+ * @brief A graph data type with several interesting algorithms
+ *
+ * @{
+ */
+
typedef struct xbt_node *xbt_node_t;
typedef struct xbt_edge *xbt_edge_t;
typedef struct xbt_graph *xbt_graph_t;
/* Not implemented yet ! */
/* void *xbt_graph_to_array(xbt_graph_t g); */
xbt_node_t* xbt_graph_shortest_paths(xbt_graph_t g);
-void xbt_graph_topological_sort(xbt_graph_t g);
+
+
+
+/** @brief transforms the network structure of a directed acyclic graph given into a linear structure
+ @return: an array containing the nodes of the graph sorted in order reverse to the path of exploration
+ if a cycle is detected an exception is raised
+ */
+
+xbt_node_t* xbt_graph_topo_sort(xbt_graph_t g);
+
xbt_edge_t* xbt_graph_spanning_tree_prim(xbt_graph_t g);
SG_END_DECL()
#endif /* _XBT_GRAPH_H */
-
+/** @} */