double position_x; /* positive value: negative means undefined */
double position_y; /* positive value: negative means undefined */
void *data; /* user data */
- void *xbtdata; /* private xbt data: should be reinitialized at the
- beginning of your algorithm if you need to use it */
} s_xbt_node_t;
/* edge structure */
xbt_node_t src;
xbt_node_t dst;
void *data; /* user data */
- void *xbtdata; /* private xbt data: should be reinitialized at the
- beginning of your algorithm if you need to use it */
- double length; /* positive value: negative means undefined */
} s_xbt_edge_t;
/* Graph structure */
xbt_dynar_t edges;
unsigned short int directed;
void *data; /* user data */
- void *xbtdata; /* private xbt data: should be reinitialized at the
- beginning of your algorithm if you need to use it */
} s_xbt_graph_t;
/* API */
XBT_PUBLIC(xbt_edge_t) xbt_graph_get_edge(xbt_graph_t g, xbt_node_t src, xbt_node_t dst);
-XBT_PUBLIC(void) xbt_graph_edge_set_length(xbt_edge_t e, double length);
-XBT_PUBLIC(double) xbt_graph_edge_get_length(xbt_edge_t e);
-
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);
XBT_PUBLIC(xbt_node_t) xbt_graph_edge_get_source(xbt_edge_t e);
XBT_PUBLIC(xbt_node_t) xbt_graph_edge_get_target(xbt_edge_t e);
-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));
-
SG_END_DECL()
#endif /* XBT_GRAPH_H */
/** @} */