X-Git-Url: http://info.iut-bm.univ-fcomte.fr/pub/gitweb/simgrid.git/blobdiff_plain/139da70d9c161eaeec3e6eb74278c966370c6e62..599347b970dec2ad471021b8eecca62e8f0854e9:/src/xbt/graph_private.h

diff --git a/src/xbt/graph_private.h b/src/xbt/graph_private.h
index 2c7cef294b..09e9232ffb 100644
--- a/src/xbt/graph_private.h
+++ b/src/xbt/graph_private.h
@@ -1,7 +1,5 @@
-/* 	$Id$	 */
-
-/* Copyright (c) 2006 Darina Dimitrova, Arnaud Legrand. 
-   All rights reserved.                  */
+/* Copyright (c) 2006, 2009, 2010. The SimGrid Team.
+ * All rights reserved.                                                     */
 
 /* This program is free software; you can redistribute it and/or modify it
  * under the terms of the license (GNU LGPL) which comes with this package. */
@@ -16,41 +14,40 @@
 
 /* Node structure */
 /* typedef struct xbt_node *xbt_node_t; */
-typedef struct xbt_node 
-{
+typedef struct xbt_node {
   xbt_dynar_t out;
-  xbt_dynar_t in;  /* not used when the graph is directed */
-  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 */  
+  xbt_dynar_t in;               /* not used when the graph is directed */
+  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 */
 /* typedef struct xbt_edge *xbt_edge_t; */
-typedef struct xbt_edge 
-{
+typedef struct xbt_edge {
   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 */
+  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 */
 /* typedef struct xbt_graph *xbt_graph_t; */
-typedef struct xbt_graph 
-{
+typedef struct xbt_graph {
   xbt_dynar_t nodes;
   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 */  
+  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);
+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 */
+#endif                          /* _XBT_GRAPH_PRIVATE_H */