Logo AND Algorithmique Numérique Distribuée

Public GIT Repository
Gcc is *very* permissive with pointers to functions. If we declare them as function...
[simgrid.git] / include / xbt / graph.h
index a3a9b6a..399bc21 100644 (file)
@@ -39,13 +39,13 @@ XBT_PUBLIC(double) xbt_graph_edge_get_length(xbt_edge_t e);
 XBT_PUBLIC(double*) xbt_graph_get_length_matrix(xbt_graph_t g);
 
 XBT_PUBLIC(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);
+                          void_f_pvoid_t node_free_function , void_f_pvoid_t edge_free_function);
 XBT_PUBLIC(void) xbt_graph_free_edge(xbt_graph_t g, xbt_edge_t e, 
-                          void_f_pvoid_t *free_function);
+                          void_f_pvoid_t free_function);
 XBT_PUBLIC(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);
+                         void_f_pvoid_t node_free_function,
+                         void_f_pvoid_t edge_free_function,
+                         void_f_pvoid_t graph_free_function);
 
 XBT_PUBLIC(int) __xbt_find_in_dynar(xbt_dynar_t dynar, void *p);
 
@@ -78,9 +78,9 @@ XBT_PUBLIC(xbt_node_t*) xbt_graph_shortest_paths(xbt_graph_t g);
             if a cycle is detected an exception is raised  
   */
 
-xbt_node_t* xbt_graph_topo_sort(xbt_graph_t g);
+XBT_PUBLIC(xbt_node_t*) xbt_graph_topo_sort(xbt_graph_t g);
 
-xbt_edge_t* xbt_graph_spanning_tree_prim(xbt_graph_t g);
+XBT_PUBLIC(xbt_edge_t*) xbt_graph_spanning_tree_prim(xbt_graph_t g);