X-Git-Url: http://info.iut-bm.univ-fcomte.fr/pub/gitweb/simgrid.git/blobdiff_plain/aecc62c76f48c4d984e4e7924a21d3d7893de589..12442080c860b7affd1b246f12895bda4f304330:/src/xbt/graph_private.h diff --git a/src/xbt/graph_private.h b/src/xbt/graph_private.h index 6e005a71f3..2c7cef294b 100644 --- a/src/xbt/graph_private.h +++ b/src/xbt/graph_private.h @@ -10,14 +10,21 @@ #define _XBT_GRAPH_PRIVATE_H #include "xbt/dynar.h" +#define NOT_EXPLORED 0 +#define CURRENTLY_EXPLORING 1 +#define ALREADY_EXPLORED 2 + /* Node structure */ /* typedef struct xbt_node *xbt_node_t; */ typedef struct xbt_node { xbt_dynar_t out; xbt_dynar_t in; /* not used when the graph is directed */ - void *data; /* used data */ - void *xbtdata; /* private xbt data */ + 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 */ @@ -26,9 +33,10 @@ typedef struct xbt_edge { xbt_node_t src; xbt_node_t dst; - void *data; /* used data */ - void *xbtdata; /* private xbt data */ - double length; + 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 */ @@ -38,10 +46,11 @@ typedef struct xbt_graph xbt_dynar_t nodes; xbt_dynar_t edges; unsigned short int directed; - void *data; /* used data */ - void *xbtdata; /* private xbt data */ + 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; void xbt_floyd_algorithm(xbt_graph_t g, double* adj,double* d, xbt_node_t* p); - +void xbt_graph_depth_visit (xbt_graph_t g,xbt_node_t n,xbt_node_t* sorted,int* idx); #endif /* _XBT_GRAPH_PRIVATE_H */