1 /* Copyright (c) 2006, 2009, 2010. The SimGrid Team.
2 * All rights reserved. */
4 /* This program is free software; you can redistribute it and/or modify it
5 * under the terms of the license (GNU LGPL) which comes with this package. */
7 #ifndef _XBT_GRAPH_PRIVATE_H
8 #define _XBT_GRAPH_PRIVATE_H
11 #define NOT_EXPLORED 0
12 #define CURRENTLY_EXPLORING 1
13 #define ALREADY_EXPLORED 2
16 /* typedef struct xbt_node *xbt_node_t; */
17 typedef struct xbt_node {
19 xbt_dynar_t in; /* not used when the graph is directed */
20 double position_x; /* positive value: negative means undefined */
21 double position_y; /* positive value: negative means undefined */
22 void *data; /* user data */
23 void *xbtdata; /* private xbt data: should be reinitialized at the
24 beginning of your algorithm if you need to use it */
28 /* typedef struct xbt_edge *xbt_edge_t; */
29 typedef struct xbt_edge {
32 void *data; /* user data */
33 void *xbtdata; /* private xbt data: should be reinitialized at the
34 beginning of your algorithm if you need to use it */
35 double length; /* positive value: negative means undefined */
39 /* typedef struct xbt_graph *xbt_graph_t; */
40 typedef struct xbt_graph {
43 unsigned short int directed;
44 void *data; /* user data */
45 void *xbtdata; /* private xbt data: should be reinitialized at the
46 beginning of your algorithm if you need to use it */
48 void xbt_floyd_algorithm(xbt_graph_t g, double *adj, double *d,
50 void xbt_graph_depth_visit(xbt_graph_t g, xbt_node_t n, xbt_node_t * sorted,
53 #endif /* _XBT_GRAPH_PRIVATE_H */