#ifndef _GRAPH_H
#include <cdt.h>
struct _grnode_s
};
struct _gredge_s
};
struct _graph_s
};
struct _grdisc_s
};
struct _grdata_s
};
struct _gralgo_s
int type;
};
/* type of graph */
#define GR_DIRECTED 0
/* discipline events */
/* Given s_t a struct type, e_t an element in s_t, and a_d an address of e_t,
** GROFFSETOF returns the offset of e_t in s_t, and
** GRSTRUCTOF returns the address of the struct that contains e_t.
*/
/* to initialize a discipline structure */
/* big number */
/* for internal use of node,edge,graph types */
#if _BLD_vgraph && defined(__EXPORT__)
#define extern __EXPORT__
#endif
#undef extern
/* return the representative node for a collapsed set of nodes */
/* return the data associated with algorithm 'al' for the given object */
/* for traversing all adjacent edges */
/******************************************************************************
* Functions germane to the algorithm to compute an optimum branching.
******************************************************************************/
#if _BLD_vgraph && defined(__EXPORT__)
#define extern extern __EXPORT__
#endif
#if !_BLD_vgraph && defined(__IMPORT__)
#define extern extern __IMPORT__
#endif
extern Gralgo_t* Grbranching;
#undef extern
#if _BLD_vgraph && defined(__EXPORT__)
#define extern __EXPORT__
#endif
#undef extern
#endif /*_GRAPH_H*/