graph_v1.h 8.3 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236
  1. /* LIBDGL -- a Directed Graph Library implementation
  2. * Copyright (C) 2002 Roberto Micarelli
  3. *
  4. * This program is free software; you can redistribute it and/or modify
  5. * it under the terms of the GNU General Public License as published by
  6. * the Free Software Foundation; either version 2 of the License, or
  7. * (at your option) any later version.
  8. *
  9. * This program is distributed in the hope that it will be useful,
  10. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  11. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
  12. * GNU General Public License for more details.
  13. *
  14. * You should have received a copy of the GNU General Public License
  15. * along with this program; if not, write to the Free Software
  16. * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
  17. */
  18. /*
  19. * best view tabstop=4
  20. */
  21. #ifndef _DGL_dglGraph_s_V1_H_
  22. #define _DGL_dglGraph_s_V1_H_
  23. #ifdef DGL_STATS
  24. #include <time.h>
  25. #endif
  26. /*
  27. * Node macros - addresses in a flat node
  28. */
  29. #define DGL_IN_NODEID_v1 0
  30. #define DGL_IN_STATUS_v1 1
  31. #define DGL_IN_TAIL_OFFSET_v1 2
  32. #define DGL_IN_ATTR_v1 3
  33. #define DGL_IN_SIZE_v1 DGL_IN_ATTR_v1
  34. #define DGL_NODE_SIZEOF_v1( nattr ) (sizeof( dglInt32_t ) * DGL_IN_SIZE_v1 + (nattr) )
  35. #define DGL_NODE_WSIZE_v1( nattr ) (DGL_NODE_SIZEOF_v1( nattr ) / sizeof(dglInt32_t) )
  36. #define DGL_NODE_ALLOC_v1( nattr ) (malloc( DGL_NODE_SIZEOF_v1( nattr ) ) )
  37. #define DGL_NODE_ID_v1(p) ((p)[DGL_IN_NODEID_v1])
  38. #define DGL_NODE_STATUS_v1(p) ((p)[DGL_IN_STATUS_v1])
  39. #define DGL_NODE_EDGESET_OFFSET_v1(p) ((p)[DGL_IN_TAIL_OFFSET_v1])
  40. #define DGL_NODE_ATTR_PTR_v1(p) ((p) + DGL_IN_ATTR_v1)
  41. /*
  42. * Edgeset macros - addresses in a flat edge-area
  43. */
  44. #define DGL_ILA_TOCNT_v1 0
  45. #define DGL_ILA_SIZE_v1 1
  46. #define DGL_ILA_TOARR_v1 DGL_ILA_SIZE_v1
  47. #define DGL_EDGESET_SIZEOF_v1(C, lattr) (sizeof( dglInt32_t ) * (DGL_ILA_SIZE_v1) + DGL_EDGE_SIZEOF_v1(lattr) * (C))
  48. #define DGL_EDGESET_WSIZE_v1(C, lattr) (DGL_EDGESET_SIZEOF_v1(C, lattr) / sizeof(dglInt32_t))
  49. #define DGL_EDGESET_ALLOC_v1(C, lattr) (malloc(DGL_EDGESET_SIZEOF_v1(C, lattr)))
  50. #define DGL_EDGESET_REALLOC_v1(P, C, lattr) (realloc(P , DGL_EDGESET_SIZEOF_v1(C, lattr)))
  51. #define DGL_EDGESET_EDGECOUNT_v1(p) ((p)[DGL_ILA_TOCNT_v1])
  52. #define DGL_EDGESET_EDGEARRAY_PTR_v1(p) ((p) + DGL_ILA_TOARR_v1)
  53. #define DGL_EDGESET_EDGE_PTR_v1(p,i,C) (((p) + DGL_ILA_TOARR_v1) + (i) * DGL_EDGE_WSIZE_v1(C))
  54. /*
  55. * Edge macros - addresses in a flat edge
  56. */
  57. #define DGL_IL_HEAD_OFFSET_v1 0
  58. #define DGL_IL_TAIL_OFFSET_v1 1
  59. #define DGL_IL_COST_v1 2
  60. #define DGL_IL_ID_v1 3
  61. #define DGL_IL_ATTR_v1 4
  62. #define DGL_IL_SIZE_v1 DGL_IL_ATTR_v1
  63. #define DGL_EDGE_SIZEOF_v1( lattr ) (sizeof( dglInt32_t ) * DGL_IL_SIZE_v1 + (lattr))
  64. #define DGL_EDGE_WSIZE_v1( lattr ) (DGL_EDGE_SIZEOF_v1( lattr ) / sizeof( dglInt32_t ))
  65. #define DGL_EDGE_ALLOC_v1( lattr ) (malloc( DGL_EDGE_SIZEOF_v1( lattr ) ))
  66. #define DGL_EDGE_HEADNODE_OFFSET_v1(p) ((p)[DGL_IL_HEAD_OFFSET_v1])
  67. #define DGL_EDGE_TAILNODE_OFFSET_v1(p) ((p)[DGL_IL_TAIL_OFFSET_v1])
  68. #define DGL_EDGE_COST_v1(p) ((p)[DGL_IL_COST_v1])
  69. #define DGL_EDGE_ID_v1(p) ((p)[DGL_IL_ID_v1])
  70. #define DGL_EDGE_ATTR_PTR_v1(p) ((p) + DGL_IL_ATTR_v1)
  71. #define DGL_EDGE_HEADNODE_ID_v1(pgrp,pl) ((pgrp->Flags&1)?\
  72. DGL_NODE_ID_v1(pgrp->pNodeBuffer+DGL_EDGE_HEADNODE_OFFSET_v1(pl)):\
  73. DGL_EDGE_HEADNODE_OFFSET_v1(pl))
  74. #define DGL_EDGE_TAILNODE_ID_v1(pgrp,pl) ((pgrp->Flags&1)?\
  75. DGL_NODE_ID_v1(pgrp->pNodeBuffer+DGL_EDGE_TAILNODE_OFFSET_v1(pl)):\
  76. DGL_EDGE_TAILNODE_OFFSET_v1(pl))
  77. /*
  78. * Scan a node buffer
  79. */
  80. #define DGL_FOREACH_NODE_v1(pgrp,pn) for((pn)=(dglInt32_t*)(pgrp)->pNodeBuffer;\
  81. (pgrp)->pNodeBuffer && (pn)<(dglInt32_t*)((pgrp)->pNodeBuffer+(pgrp)->iNodeBuffer);\
  82. (pn)+=DGL_NODE_WSIZE_v1((pgrp)->NodeAttrSize))
  83. /*
  84. * Scan a edgeset
  85. */
  86. #define DGL_FOREACH_EDGE_v1(pgrp,pla,pl) for((pl)=DGL_EDGESET_EDGEARRAY_PTR_v1(pla);\
  87. (pl)<(pla)+DGL_EDGE_WSIZE_v1((pgrp)->EdgeAttrSize)*DGL_EDGESET_EDGECOUNT_v1(pla);\
  88. (pl)+=DGL_EDGE_WSIZE_v1((pgrp)->EdgeAttrSize))
  89. /*
  90. * Node Buffer Utilities
  91. */
  92. #define DGL_NODEBUFFER_SHIFT_v1(pgrp,o) ((dglInt32_t*)((pgrp)->pNodeBuffer + (o)))
  93. #define DGL_NODEBUFFER_OFFSET_v1(pgrp,p) ((dglInt32_t)((dglByte_t *)p - (dglByte_t *)(pgrp)->pNodeBuffer))
  94. /*
  95. * Edge Buffer Utilities
  96. */
  97. #define DGL_EDGEBUFFER_SHIFT_v1(pgrp,o) ((dglInt32_t*)((pgrp)->pEdgeBuffer + (o)))
  98. #define DGL_EDGEBUFFER_OFFSET_v1(pgrp,pl) ((dglInt32_t)((dglByte_t *)pl - (dglByte_t *)(pgrp)->pEdgeBuffer))
  99. int dgl_add_edge_V1(dglGraph_s * pgraph,
  100. dglInt32_t nHead,
  101. dglInt32_t nTail,
  102. dglInt32_t nCost,
  103. dglInt32_t nEdge,
  104. void *pvHeadAttr,
  105. void *pvTailAttr, void *pvEdgeAttr, dglInt32_t nFlags);
  106. int dgl_unflatten_V1(dglGraph_s * pgraph);
  107. int dgl_flatten_V1(dglGraph_s * pgraph);
  108. int dgl_initialize_V1(dglGraph_s * pgraph);
  109. int dgl_release_V1(dglGraph_s * pgraph);
  110. int dgl_write_V1(dglGraph_s * pgraph, int fd);
  111. int dgl_read_V1(dglGraph_s * pgraph, int fd);
  112. int dgl_sp_cache_initialize_V1(dglGraph_s * pgraph, dglSPCache_s * pCache,
  113. dglInt32_t nStart);
  114. void dgl_sp_cache_release_V1(dglGraph_s * pgraph, dglSPCache_s * pCache);
  115. int dgl_dijkstra_V1_TREE(dglGraph_s * pgraph,
  116. dglSPReport_s ** ppReport,
  117. dglInt32_t * pDistance,
  118. dglInt32_t nStart,
  119. dglInt32_t nDestination,
  120. dglSPClip_fn fnClip,
  121. void *pvClipArg, dglSPCache_s * pCache);
  122. int dgl_dijkstra_V1_FLAT(dglGraph_s * pgraph,
  123. dglSPReport_s ** ppReport,
  124. dglInt32_t * pDistance,
  125. dglInt32_t nStart,
  126. dglInt32_t nDestination,
  127. dglSPClip_fn fnClip,
  128. void *pvClipArg, dglSPCache_s * pCache);
  129. int dgl_dijkstra_V1(dglGraph_s * pgraph,
  130. dglSPReport_s ** ppReport,
  131. dglInt32_t * pDistance,
  132. dglInt32_t nStart,
  133. dglInt32_t nDestination,
  134. dglSPClip_fn fnClip,
  135. void *pvClipArg, dglSPCache_s * pCache);
  136. int dgl_span_depthfirst_spanning_V1_TREE(dglGraph_s * pgraphIn,
  137. dglGraph_s * pgraphOut,
  138. dglInt32_t nVertex,
  139. void *pvVisited,
  140. dglSpanClip_fn fnClip,
  141. void *pvClipArg);
  142. int dgl_span_depthfirst_spanning_V1_FLAT(dglGraph_s * pgraphIn,
  143. dglGraph_s * pgraphOut,
  144. dglInt32_t nVertex,
  145. void *pvVisited,
  146. dglSpanClip_fn fnClip,
  147. void *pvClipArg);
  148. int dgl_depthfirst_spanning_V1(dglGraph_s * pgraphIn,
  149. dglGraph_s * pgraphOut,
  150. dglInt32_t nVertex,
  151. void *pvVisited,
  152. dglSpanClip_fn fnClip, void *pvClipArg);
  153. int dgl_span_minimum_spanning_V1_TREE(dglGraph_s * pgraphIn,
  154. dglGraph_s * pgraphOut,
  155. dglInt32_t nVertex,
  156. dglSpanClip_fn fnClip, void *pvClipArg);
  157. int dgl_span_minimum_spanning_V1_FLAT(dglGraph_s * pgraphIn,
  158. dglGraph_s * pgraphOut,
  159. dglInt32_t nVertex,
  160. dglSpanClip_fn fnClip, void *pvClipArg);
  161. int dgl_minimum_spanning_V1(dglGraph_s * pgraphIn,
  162. dglGraph_s * pgraphOut,
  163. dglInt32_t nVertex,
  164. dglSpanClip_fn fnClip, void *pvClipArg);
  165. int dgl_add_node_V1(dglGraph_s * pgraph,
  166. dglInt32_t nId, void *pvNodeAttr, dglInt32_t nFlags);
  167. int dgl_del_node_V1(dglGraph_s * pgraph, dglInt32_t nId);
  168. dglInt32_t *dgl_get_node_V1(dglGraph_s * pgraph, dglInt32_t nId);
  169. dglInt32_t *dgl_get_edge_V1(dglGraph_s * pgraph, dglInt32_t nId);
  170. int dgl_del_edge_V1(dglGraph_s * pgraph, dglInt32_t nId);
  171. dglInt32_t *dgl_getnode_outedgeset_V1(dglGraph_s * pgraph,
  172. dglInt32_t * pnode);
  173. /*
  174. * Node Traversing
  175. */
  176. int dgl_node_t_initialize_V1(dglGraph_s * pGraph, dglNodeTraverser_s * pT);
  177. void dgl_node_t_release_V1(dglNodeTraverser_s * pT);
  178. dglInt32_t *dgl_node_t_first_V1(dglNodeTraverser_s * pT);
  179. dglInt32_t *dgl_node_t_next_V1(dglNodeTraverser_s * pT);
  180. dglInt32_t *dgl_node_t_find_V1(dglNodeTraverser_s * pT, dglInt32_t nId);
  181. /*
  182. * Edgeset Traversing
  183. */
  184. int dgl_edgeset_t_initialize_V1(dglGraph_s * pGraph,
  185. dglEdgesetTraverser_s * pTraverser,
  186. dglInt32_t * pnEdgeset);
  187. void dgl_edgeset_t_release_V1(dglEdgesetTraverser_s * pTraverser);
  188. dglInt32_t *dgl_edgeset_t_first_V1(dglEdgesetTraverser_s * pTraverser);
  189. dglInt32_t *dgl_edgeset_t_next_V1(dglEdgesetTraverser_s * pTraverser);
  190. int dgl_edge_t_initialize_V1(dglGraph_s * pGraph,
  191. dglEdgeTraverser_s * pTraverser,
  192. dglEdgePrioritizer_s * pEP);
  193. void dgl_edge_t_release_V1(dglEdgeTraverser_s * pTraverser);
  194. dglInt32_t *dgl_edge_t_first_V1(dglEdgeTraverser_s * pT);
  195. dglInt32_t *dgl_edge_t_next_V1(dglEdgeTraverser_s * pT);
  196. #endif