-XBT_PUBLIC(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_PUBLIC(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));
-XBT_PUBLIC(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 *));
-XBT_PUBLIC(xbt_graph_t) xbt_graph_load (const char *filename);
-XBT_PUBLIC(void) xbt_graph_save (xbt_graph_t span,
- const char *filename,
- const char *(nname) (xbt_node_t),
- const char *(ename) (xbt_edge_t));
-
-/* Not implemented yet ! */
-/* void *xbt_graph_to_array(xbt_graph_t g); */
-XBT_PUBLIC(xbt_node_t *) xbt_graph_shortest_paths(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_PUBLIC(xbt_node_t *) xbt_graph_topo_sort(xbt_graph_t g);
-
-XBT_PUBLIC(xbt_edge_t *) xbt_graph_spanning_tree_prim(xbt_graph_t g);
-
-
-
-
-/** Convenient for loop : g is a graph, n a node, e an edge, b a bucket and i an item **/
-
-/* #define xbt_graph_foreachInNeighbor(v,n,i) \ */
-/* for(i=xbt_fifo_get_first_item((v)->in); \ */
-/* ((i)?(n=((xbt_edge_t)((xbt_fifo_get_item_content(i)) */
-/* )->src):(NULL));\ */
-/* i=xbt_fifo_get_next_item(i)) */
-/* #define xbt_graph_foreachOutNeighbor(v,n,i) \ */
-/* for(i=xbt_fifo_get_first_item((v)->out); \ */
-/* ((i)?(n=((xbt_edge_t)(xbt_fifo_get_item_content(i)))->dst):(NULL));\ */
-/* i=xbt_fifo_get_next_item(i)) */
-