graph_v2.h 8.6 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242
  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_V2_H_
  22. #define _DGL_dglGraph_s_V2_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_v2 0
  30. #define DGL_IN_STATUS_v2 1
  31. #define DGL_IN_EDGESET_OFFSET_v2 2
  32. #define DGL_IN_ATTR_v2 3
  33. #define DGL_IN_SIZE_v2 DGL_IN_ATTR_v2
  34. #define DGL_NODE_SIZEOF_v2( nattr ) (sizeof( dglInt32_t ) * DGL_IN_SIZE_v2 + (nattr) )
  35. #define DGL_NODE_WSIZE_v2( nattr ) (DGL_NODE_SIZEOF_v2( nattr ) / sizeof(dglInt32_t) )
  36. #define DGL_NODE_ALLOC_v2( nattr ) (malloc( DGL_NODE_SIZEOF_v2( nattr ) ) )
  37. #define DGL_NODE_ID_v2(p) ((p)[DGL_IN_NODEID_v2])
  38. #define DGL_NODE_STATUS_v2(p) ((p)[DGL_IN_STATUS_v2])
  39. #define DGL_NODE_EDGESET_OFFSET_v2(p) ((p)[DGL_IN_EDGESET_OFFSET_v2])
  40. #define DGL_NODE_ATTR_PTR_v2(p) ((p) + DGL_IN_ATTR_v2)
  41. /*
  42. * Edgeset macros - addresses in a flat edge-area
  43. */
  44. #define DGL_ILA_TOCNT_v2 0
  45. #define DGL_ILA_SIZE_v2 1
  46. #define DGL_ILA_TOARR_v2 DGL_ILA_SIZE_v2
  47. #define DGL_EDGESET_SIZEOF_v2(C, lattr) (sizeof( dglInt32_t ) * ((C) + 1))
  48. #define DGL_EDGESET_WSIZE_v2(C, lattr) (DGL_EDGESET_SIZEOF_v2(C, lattr) / sizeof(dglInt32_t))
  49. #define DGL_EDGESET_ALLOC_v2(C, lattr) (malloc(DGL_EDGESET_SIZEOF_v2(C, lattr)))
  50. #define DGL_EDGESET_REALLOC_v2(P, C, lattr) (realloc(P , DGL_EDGESET_SIZEOF_v2(C, lattr)))
  51. #define DGL_EDGESET_EDGECOUNT_v2(p) ((p)[DGL_ILA_TOCNT_v2])
  52. #define DGL_EDGESET_EDGEARRAY_PTR_v2(p) ((p) + DGL_ILA_TOARR_v2)
  53. #define DGL_EDGESET_EDGE_PTR_v2(pgrp,p,i) DGL_EDGEBUFFER_SHIFT_v2(pgrp,*((p) + DGL_ILA_TOARR_v2 + (i)))
  54. /*
  55. * Edge macros - addresses in a flat edge
  56. */
  57. #define DGL_IL_HEAD_OFFSET_v2 0
  58. #define DGL_IL_TAIL_OFFSET_v2 1
  59. #define DGL_IL_STATUS_v2 2
  60. #define DGL_IL_COST_v2 3
  61. #define DGL_IL_ID_v2 4
  62. #define DGL_IL_ATTR_v2 5
  63. #define DGL_IL_SIZE_v2 DGL_IL_ATTR_v2
  64. #define DGL_EDGE_SIZEOF_v2( lattr ) (sizeof( dglInt32_t ) * DGL_IL_SIZE_v2 + (lattr))
  65. #define DGL_EDGE_WSIZE_v2( lattr ) (DGL_EDGE_SIZEOF_v2( lattr ) / sizeof( dglInt32_t ))
  66. #define DGL_EDGE_ALLOC_v2( lattr ) (malloc( DGL_EDGE_SIZEOF_v2( lattr ) ))
  67. #define DGL_EDGE_HEADNODE_OFFSET_v2(p) ((p)[DGL_IL_HEAD_OFFSET_v2])
  68. #define DGL_EDGE_TAILNODE_OFFSET_v2(p) ((p)[DGL_IL_TAIL_OFFSET_v2])
  69. #define DGL_EDGE_STATUS_v2(p) ((p)[DGL_IL_STATUS_v2])
  70. #define DGL_EDGE_COST_v2(p) ((p)[DGL_IL_COST_v2])
  71. #define DGL_EDGE_ID_v2(p) ((p)[DGL_IL_ID_v2])
  72. #define DGL_EDGE_ATTR_PTR_v2(p) ((p) + DGL_IL_ATTR_v2)
  73. #define DGL_EDGE_HEADNODE_ID_v2(pgrp,pl) ((pgrp->Flags&1)?\
  74. DGL_NODE_ID_v2(pgrp->pNodeBuffer+DGL_EDGE_HEADNODE_OFFSET_v2(pl)):\
  75. DGL_EDGE_HEADNODE_OFFSET_v2(pl))
  76. #define DGL_EDGE_TAILNODE_ID_v2(pgrp,pl) ((pgrp->Flags&1)?\
  77. DGL_NODE_ID_v2(pgrp->pNodeBuffer+DGL_EDGE_TAILNODE_OFFSET_v2(pl)):\
  78. DGL_EDGE_TAILNODE_OFFSET_v2(pl))
  79. /*
  80. * Scan a node buffer
  81. */
  82. #define DGL_FOREACH_NODE_v2(pgrp,pn) for((pn)=(dglInt32_t*)(pgrp)->pNodeBuffer;\
  83. (pgrp)->pNodeBuffer && (pn)<(dglInt32_t*)((pgrp)->pNodeBuffer+(pgrp)->iNodeBuffer);\
  84. (pn)+=DGL_NODE_WSIZE_v2((pgrp)->NodeAttrSize))
  85. /*
  86. * Scan a edgeset
  87. */
  88. #define DGL_FOREACH_EDGE_v2(pgrp,pla,pl,il)\
  89. for((il)=0, (pl)=DGL_EDGESET_EDGE_PTR_v2(pgrp,pla,il);\
  90. (il)<DGL_EDGESET_EDGECOUNT_v2(pla);\
  91. (il)++, (pl)=DGL_EDGESET_EDGE_PTR_v2(pgrp,pla,il))
  92. /*
  93. * Node Buffer Utilities
  94. */
  95. #define DGL_NODEBUFFER_SHIFT_v2(pgrp,o) ((dglInt32_t*)((pgrp)->pNodeBuffer + (o)))
  96. #define DGL_NODEBUFFER_OFFSET_v2(pgrp,p) ((dglInt32_t)((dglByte_t *)p - (dglByte_t *)(pgrp)->pNodeBuffer))
  97. /*
  98. * Edge Buffer Utilities
  99. */
  100. #define DGL_EDGEBUFFER_SHIFT_v2(pgrp,o) ((dglInt32_t*)((pgrp)->pEdgeBuffer + (o)))
  101. #define DGL_EDGEBUFFER_OFFSET_v2(pgrp,pl) ((dglInt32_t)((dglByte_t *)pl - (dglByte_t *)(pgrp)->pEdgeBuffer))
  102. int dgl_add_edge_V2(dglGraph_s * pgraph,
  103. dglInt32_t nHead,
  104. dglInt32_t nTail,
  105. dglInt32_t nCost,
  106. dglInt32_t nEdge,
  107. void *pvHeadAttr,
  108. void *pvTailAttr, void *pvEdgeAttr, dglInt32_t nFlags);
  109. int dgl_unflatten_V2(dglGraph_s * pgraph);
  110. int dgl_flatten_V2(dglGraph_s * pgraph);
  111. int dgl_initialize_V2(dglGraph_s * pgraph);
  112. int dgl_release_V2(dglGraph_s * pgraph);
  113. int dgl_write_V2(dglGraph_s * pgraph, int fd);
  114. int dgl_read_V2(dglGraph_s * pgraph, int fd, int version);
  115. int dgl_sp_cache_initialize_V2(dglGraph_s * pgraph, dglSPCache_s * pCache,
  116. dglInt32_t nStart);
  117. void dgl_sp_cache_release_V2(dglGraph_s * pgraph, dglSPCache_s * pCache);
  118. int dgl_dijkstra_V2_TREE(dglGraph_s * pgraph,
  119. dglSPReport_s ** ppReport,
  120. dglInt32_t * pDistance,
  121. dglInt32_t nStart,
  122. dglInt32_t nDestination,
  123. dglSPClip_fn fnClip,
  124. void *pvClipArg, dglSPCache_s * pCache);
  125. int dgl_dijkstra_V2_FLAT(dglGraph_s * pgraph,
  126. dglSPReport_s ** ppReport,
  127. dglInt32_t * pDistance,
  128. dglInt32_t nStart,
  129. dglInt32_t nDestination,
  130. dglSPClip_fn fnClip,
  131. void *pvClipArg, dglSPCache_s * pCache);
  132. int dgl_dijkstra_V2(dglGraph_s * pgraph,
  133. dglSPReport_s ** ppReport,
  134. dglInt32_t * pDistance,
  135. dglInt32_t nStart,
  136. dglInt32_t nDestination,
  137. dglSPClip_fn fnClip,
  138. void *pvClipArg, dglSPCache_s * pCache);
  139. int dgl_span_depthfirst_spanning_V2_TREE(dglGraph_s * pgraphIn,
  140. dglGraph_s * pgraphOut,
  141. dglInt32_t nVertex,
  142. void *pvVisited,
  143. dglSpanClip_fn fnClip,
  144. void *pvClipArg);
  145. int dgl_span_depthfirst_spanning_V2_FLAT(dglGraph_s * pgraphIn,
  146. dglGraph_s * pgraphOut,
  147. dglInt32_t nVertex,
  148. void *pvVisited,
  149. dglSpanClip_fn fnClip,
  150. void *pvClipArg);
  151. int dgl_depthfirst_spanning_V2(dglGraph_s * pgraphIn,
  152. dglGraph_s * pgraphOut,
  153. dglInt32_t nVertex,
  154. void *pvVisited,
  155. dglSpanClip_fn fnClip, void *pvClipArg);
  156. int dgl_span_minimum_spanning_V2_TREE(dglGraph_s * pgraphIn,
  157. dglGraph_s * pgraphOut,
  158. dglInt32_t nVertex,
  159. dglSpanClip_fn fnClip, void *pvClipArg);
  160. int dgl_span_minimum_spanning_V2_FLAT(dglGraph_s * pgraphIn,
  161. dglGraph_s * pgraphOut,
  162. dglInt32_t nVertex,
  163. dglSpanClip_fn fnClip, void *pvClipArg);
  164. int dgl_minimum_spanning_V2(dglGraph_s * pgraphIn,
  165. dglGraph_s * pgraphOut,
  166. dglInt32_t nVertex,
  167. dglSpanClip_fn fnClip, void *pvClipArg);
  168. int dgl_add_node_V2(dglGraph_s * pgraph,
  169. dglInt32_t nId, void *pvNodeAttr, dglInt32_t nFlags);
  170. int dgl_del_node_outedge_V2(dglGraph_s * pgraph, dglInt32_t nNode,
  171. dglInt32_t nEdge);
  172. int dgl_del_node_inedge_V2(dglGraph_s * pgraph, dglInt32_t nNode,
  173. dglInt32_t nEdge);
  174. int dgl_del_node_V2(dglGraph_s * pgraph, dglInt32_t nId);
  175. dglInt32_t *dgl_get_node_V2(dglGraph_s * pgraph, dglInt32_t nId);
  176. dglInt32_t *dgl_get_edge_V2(dglGraph_s * pgraph, dglInt32_t nId);
  177. int dgl_del_edge_V2(dglGraph_s * pgraph, dglInt32_t nId);
  178. dglInt32_t *dgl_getnode_outedgeset_V2(dglGraph_s * pgraph,
  179. dglInt32_t * pnode);
  180. dglInt32_t *dgl_getnode_inedgeset_V2(dglGraph_s * pgraph, dglInt32_t * pnode);
  181. /*
  182. * Node Traversing
  183. */
  184. int dgl_node_t_initialize_V2(dglGraph_s * pGraph, dglNodeTraverser_s * pT);
  185. void dgl_node_t_release_V2(dglNodeTraverser_s * pT);
  186. dglInt32_t *dgl_node_t_first_V2(dglNodeTraverser_s * pT);
  187. dglInt32_t *dgl_node_t_next_V2(dglNodeTraverser_s * pT);
  188. dglInt32_t *dgl_node_t_find_V2(dglNodeTraverser_s * pT, dglInt32_t nId);
  189. /*
  190. * Edgeset Traversing
  191. */
  192. int dgl_edgeset_t_initialize_V2(dglGraph_s * pGraph,
  193. dglEdgesetTraverser_s * pTraverser,
  194. dglInt32_t * pnEdgeset);
  195. void dgl_edgeset_t_release_V2(dglEdgesetTraverser_s * pTraverser);
  196. dglInt32_t *dgl_edgeset_t_first_V2(dglEdgesetTraverser_s * pTraverser);
  197. dglInt32_t *dgl_edgeset_t_next_V2(dglEdgesetTraverser_s * pTraverser);
  198. int dgl_edge_t_initialize_V2(dglGraph_s * pGraph,
  199. dglEdgeTraverser_s * pTraverser,
  200. dglEdgePrioritizer_s * pEP);
  201. void dgl_edge_t_release_V2(dglEdgeTraverser_s * pTraverser);
  202. dglInt32_t *dgl_edge_t_first_V2(dglEdgeTraverser_s * pT);
  203. dglInt32_t *dgl_edge_t_next_V2(dglEdgeTraverser_s * pT);
  204. #endif