X-Git-Url: http://info.iut-bm.univ-fcomte.fr/pub/gitweb/simgrid.git/blobdiff_plain/ad5a61715d2113a2b341b6e867e65588dd4faf68..5d1a13b3f51a5f4f6c28d6877f0cbde43e71d954:/src/xbt/graph_private.h diff --git a/src/xbt/graph_private.h b/src/xbt/graph_private.h index 8b13789179..607416183c 100644 --- a/src/xbt/graph_private.h +++ b/src/xbt/graph_private.h @@ -1 +1,52 @@ +/* $Id$ */ +/* Copyright (c) 2006 Darina Dimitrova, Arnaud Legrand. + 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. */ + +#ifndef _XBT_GRAPH_PRIVATE_H +#define _XBT_GRAPH_PRIVATE_H +#include "xbt/dynar.h" + +/* 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 */ + 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 +{ + 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 */ +/* typedef struct xbt_graph *xbt_graph_t; */ +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 */ +} s_xbt_graph_t; +void xbt_floyd_algorithm(xbt_graph_t g, double* adj,double* d, xbt_node_t* p); + + +#endif /* _XBT_GRAPH_PRIVATE_H */