GRASS 8 Programmer's Manual 8.6.0dev(2026)-4bb960b182
Loading...
Searching...
No Matches
graph_v2.h
Go to the documentation of this file.
1/* LIBDGL -- a Directed Graph Library implementation
2 * SPDX-FileCopyrightText: 2002 Roberto Micarelli
3 * SPDX-FileCopyrightText: GRASS Development Team
4 * SPDX-License-Identifier: GPL-2.0-or-later
5 */
6
7/*
8 * best view tabstop=4
9 */
10
11#ifndef _DGL_dglGraph_s_V2_H_
12#define _DGL_dglGraph_s_V2_H_
13
14#ifdef DGL_STATS
15#include <time.h>
16#endif
17
18/*
19 * Node macros - addresses in a flat node
20 */
21#define DGL_IN_NODEID_v2 0
22#define DGL_IN_STATUS_v2 1
23#define DGL_IN_EDGESET_OFFSET_v2 2
24#define DGL_IN_ATTR_v2 3
25#define DGL_IN_SIZE_v2 DGL_IN_ATTR_v2
26
27#define DGL_NODE_SIZEOF_v2(nattr) \
28 (sizeof(dglInt32_t) * DGL_IN_SIZE_v2 + (nattr))
29#define DGL_NODE_WSIZE_v2(nattr) \
30 (DGL_NODE_SIZEOF_v2(nattr) / sizeof(dglInt32_t))
31#define DGL_NODE_ALLOC_v2(nattr) (malloc(DGL_NODE_SIZEOF_v2(nattr)))
32
33#define DGL_NODE_ID_v2(p) ((p)[DGL_IN_NODEID_v2])
34#define DGL_NODE_STATUS_v2(p) ((p)[DGL_IN_STATUS_v2])
35#define DGL_NODE_EDGESET_OFFSET_v2(p) ((p)[DGL_IN_EDGESET_OFFSET_v2])
36#define DGL_NODE_ATTR_PTR_v2(p) ((p) + DGL_IN_ATTR_v2)
37
38/*
39 * Edgeset macros - addresses in a flat edge-area
40 */
41#define DGL_ILA_TOCNT_v2 0
42#define DGL_ILA_SIZE_v2 1
43#define DGL_ILA_TOARR_v2 DGL_ILA_SIZE_v2
44
45#define DGL_EDGESET_SIZEOF_v2(C, lattr) (sizeof(dglInt32_t) * ((C) + 1))
46#define DGL_EDGESET_WSIZE_v2(C, lattr) \
47 (DGL_EDGESET_SIZEOF_v2(C, lattr) / sizeof(dglInt32_t))
48#define DGL_EDGESET_ALLOC_v2(C, lattr) (malloc(DGL_EDGESET_SIZEOF_v2(C, lattr)))
49#define DGL_EDGESET_REALLOC_v2(P, C, lattr) \
50 (realloc(P, DGL_EDGESET_SIZEOF_v2(C, lattr)))
51
52#define DGL_EDGESET_EDGECOUNT_v2(p) ((p)[DGL_ILA_TOCNT_v2])
53#define DGL_EDGESET_EDGEARRAY_PTR_v2(p) ((p) + DGL_ILA_TOARR_v2)
54#define DGL_EDGESET_EDGE_PTR_v2(pgrp, p, i) \
55 DGL_EDGEBUFFER_SHIFT_v2(pgrp, *((p) + DGL_ILA_TOARR_v2 + (i)))
56
57/*
58 * Edge macros - addresses in a flat edge
59 */
60#define DGL_IL_HEAD_OFFSET_v2 0
61#define DGL_IL_TAIL_OFFSET_v2 1
62#define DGL_IL_STATUS_v2 2
63#define DGL_IL_COST_v2 3
64#define DGL_IL_ID_v2 4
65#define DGL_IL_ATTR_v2 5
66#define DGL_IL_SIZE_v2 DGL_IL_ATTR_v2
67
68#define DGL_EDGE_SIZEOF_v2(lattr) \
69 (sizeof(dglInt32_t) * DGL_IL_SIZE_v2 + (lattr))
70#define DGL_EDGE_WSIZE_v2(lattr) \
71 (DGL_EDGE_SIZEOF_v2(lattr) / sizeof(dglInt32_t))
72#define DGL_EDGE_ALLOC_v2(lattr) (malloc(DGL_EDGE_SIZEOF_v2(lattr)))
73
74#define DGL_EDGE_HEADNODE_OFFSET_v2(p) ((p)[DGL_IL_HEAD_OFFSET_v2])
75#define DGL_EDGE_TAILNODE_OFFSET_v2(p) ((p)[DGL_IL_TAIL_OFFSET_v2])
76#define DGL_EDGE_STATUS_v2(p) ((p)[DGL_IL_STATUS_v2])
77#define DGL_EDGE_COST_v2(p) ((p)[DGL_IL_COST_v2])
78#define DGL_EDGE_ID_v2(p) ((p)[DGL_IL_ID_v2])
79#define DGL_EDGE_ATTR_PTR_v2(p) ((p) + DGL_IL_ATTR_v2)
80#define DGL_EDGE_HEADNODE_ID_v2(pgrp, pl) \
81 ((pgrp->Flags & 1) \
82 ? DGL_NODE_ID_v2(pgrp->pNodeBuffer + DGL_EDGE_HEADNODE_OFFSET_v2(pl)) \
83 : DGL_EDGE_HEADNODE_OFFSET_v2(pl))
84#define DGL_EDGE_TAILNODE_ID_v2(pgrp, pl) \
85 ((pgrp->Flags & 1) \
86 ? DGL_NODE_ID_v2(pgrp->pNodeBuffer + DGL_EDGE_TAILNODE_OFFSET_v2(pl)) \
87 : DGL_EDGE_TAILNODE_OFFSET_v2(pl))
88
89/*
90 * Scan a node buffer
91 */
92#define DGL_FOREACH_NODE_v2(pgrp, pn) \
93 for ((pn) = (dglInt32_t *)(pgrp)->pNodeBuffer; \
94 (pgrp)->pNodeBuffer && \
95 (pn) < (dglInt32_t *)((pgrp)->pNodeBuffer + (pgrp)->iNodeBuffer); \
96 (pn) += DGL_NODE_WSIZE_v2((pgrp)->NodeAttrSize))
97/*
98 * Scan a edgeset
99 */
100#define DGL_FOREACH_EDGE_v2(pgrp, pla, pl, il) \
101 for ((il) = 0, (pl) = DGL_EDGESET_EDGE_PTR_v2(pgrp, pla, il); \
102 (il) < DGL_EDGESET_EDGECOUNT_v2(pla); \
103 (il)++, (pl) = DGL_EDGESET_EDGE_PTR_v2(pgrp, pla, il))
104/*
105 * Node Buffer Utilities
106 */
107#define DGL_NODEBUFFER_SHIFT_v2(pgrp, o) \
108 ((dglInt32_t *)((pgrp)->pNodeBuffer + (o)))
109#define DGL_NODEBUFFER_OFFSET_v2(pgrp, p) \
110 ((dglInt32_t)((dglByte_t *)p - (dglByte_t *)(pgrp)->pNodeBuffer))
111
112/*
113 * Edge Buffer Utilities
114 */
115#define DGL_EDGEBUFFER_SHIFT_v2(pgrp, o) \
116 ((dglInt32_t *)((pgrp)->pEdgeBuffer + (o)))
117#define DGL_EDGEBUFFER_OFFSET_v2(pgrp, pl) \
118 ((dglInt32_t)((dglByte_t *)pl - (dglByte_t *)(pgrp)->pEdgeBuffer))
119
122 void *pvTailAttr, void *pvEdgeAttr, dglInt32_t nFlags);
123
128int dgl_write_V2(dglGraph_s *pgraph, int fd);
129int dgl_read_V2(dglGraph_s *pgraph, int fd, int version);
130
134
147
150 dglInt32_t nVertex, void *pvVisited,
152 void *pvClipArg);
155 dglInt32_t nVertex, void *pvVisited,
157 void *pvClipArg);
159 dglInt32_t nVertex, void *pvVisited,
161
170 void *pvClipArg);
171
180
183
186
187/*
188 * Node Traversing
189 */
195
196/*
197 * Edgeset Traversing
198 */
201 dglInt32_t *pnEdgeset);
205
211
212#endif
int(* dglSPClip_fn)(dglGraph_s *, dglSPClipInput_s *, dglSPClipOutput_s *, void *)
Definition graph.h:167
int(* dglSpanClip_fn)(dglGraph_s *, dglGraph_s *, dglSpanClipInput_s *, dglSpanClipOutput_s *, void *)
Definition graph.h:173
int dgl_dijkstra_V2(dglGraph_s *pgraph, dglSPReport_s **ppReport, dglInt32_t *pDistance, dglInt32_t nStart, dglInt32_t nDestination, dglSPClip_fn fnClip, void *pvClipArg, dglSPCache_s *pCache)
Definition graph_v2.c:49
dglInt32_t * dgl_get_edge_V2(dglGraph_s *pgraph, dglInt32_t nId)
dglInt32_t * dgl_edgeset_t_next_V2(dglEdgesetTraverser_s *pTraverser)
int dgl_span_minimum_spanning_V2_TREE(dglGraph_s *pgraphIn, dglGraph_s *pgraphOut, dglInt32_t nVertex, dglSpanClip_fn fnClip, void *pvClipArg)
int dgl_edgeset_t_initialize_V2(dglGraph_s *pGraph, dglEdgesetTraverser_s *pTraverser, dglInt32_t *pnEdgeset)
int dgl_write_V2(dglGraph_s *pgraph, int fd)
Definition graph_v2.c:131
int dgl_dijkstra_V2_FLAT(dglGraph_s *pgraph, dglSPReport_s **ppReport, dglInt32_t *pDistance, dglInt32_t nStart, dglInt32_t nDestination, dglSPClip_fn fnClip, void *pvClipArg, dglSPCache_s *pCache)
int dgl_release_V2(dglGraph_s *pgraph)
Definition graph_v2.c:111
int dgl_add_edge_V2(dglGraph_s *pgraph, dglInt32_t nHead, dglInt32_t nTail, dglInt32_t nCost, dglInt32_t nEdge, void *pvHeadAttr, void *pvTailAttr, void *pvEdgeAttr, dglInt32_t nFlags)
int dgl_flatten_V2(dglGraph_s *pgraph)
int dgl_node_t_initialize_V2(dglGraph_s *pGraph, dglNodeTraverser_s *pT)
int dgl_edge_t_initialize_V2(dglGraph_s *pGraph, dglEdgeTraverser_s *pTraverser, dglEdgePrioritizer_s *pEP)
int dgl_del_node_inedge_V2(dglGraph_s *pgraph, dglInt32_t nNode, dglInt32_t nEdge)
int dgl_dijkstra_V2_TREE(dglGraph_s *pgraph, dglSPReport_s **ppReport, dglInt32_t *pDistance, dglInt32_t nStart, dglInt32_t nDestination, dglSPClip_fn fnClip, void *pvClipArg, dglSPCache_s *pCache)
dglInt32_t * dgl_node_t_first_V2(dglNodeTraverser_s *pT)
int dgl_del_node_outedge_V2(dglGraph_s *pgraph, dglInt32_t nNode, dglInt32_t nEdge)
dglInt32_t * dgl_get_node_V2(dglGraph_s *pgraph, dglInt32_t nId)
int dgl_depthfirst_spanning_V2(dglGraph_s *pgraphIn, dglGraph_s *pgraphOut, dglInt32_t nVertex, void *pvVisited, dglSpanClip_fn fnClip, void *pvClipArg)
Definition graph_v2.c:64
int dgl_span_minimum_spanning_V2_FLAT(dglGraph_s *pgraphIn, dglGraph_s *pgraphOut, dglInt32_t nVertex, dglSpanClip_fn fnClip, void *pvClipArg)
void dgl_sp_cache_release_V2(dglGraph_s *pgraph, dglSPCache_s *pCache)
int dgl_initialize_V2(dglGraph_s *pgraph)
Definition graph_v2.c:92
dglInt32_t * dgl_node_t_find_V2(dglNodeTraverser_s *pT, dglInt32_t nId)
int dgl_unflatten_V2(dglGraph_s *pgraph)
void dgl_edgeset_t_release_V2(dglEdgesetTraverser_s *pTraverser)
int dgl_read_V2(dglGraph_s *pgraph, int fd, int version)
Definition graph_v2.c:226
dglInt32_t * dgl_edge_t_first_V2(dglEdgeTraverser_s *pT)
dglInt32_t * dgl_node_t_next_V2(dglNodeTraverser_s *pT)
dglInt32_t * dgl_edge_t_next_V2(dglEdgeTraverser_s *pT)
dglInt32_t * dgl_edgeset_t_first_V2(dglEdgesetTraverser_s *pTraverser)
int dgl_del_edge_V2(dglGraph_s *pgraph, dglInt32_t nId)
int dgl_span_depthfirst_spanning_V2_FLAT(dglGraph_s *pgraphIn, dglGraph_s *pgraphOut, dglInt32_t nVertex, void *pvVisited, dglSpanClip_fn fnClip, void *pvClipArg)
int dgl_del_node_V2(dglGraph_s *pgraph, dglInt32_t nId)
int dgl_sp_cache_initialize_V2(dglGraph_s *pgraph, dglSPCache_s *pCache, dglInt32_t nStart)
void dgl_node_t_release_V2(dglNodeTraverser_s *pT)
dglInt32_t * dgl_getnode_inedgeset_V2(dglGraph_s *pgraph, dglInt32_t *pnode)
int dgl_add_node_V2(dglGraph_s *pgraph, dglInt32_t nId, void *pvNodeAttr, dglInt32_t nFlags)
int dgl_span_depthfirst_spanning_V2_TREE(dglGraph_s *pgraphIn, dglGraph_s *pgraphOut, dglInt32_t nVertex, void *pvVisited, dglSpanClip_fn fnClip, void *pvClipArg)
int dgl_minimum_spanning_V2(dglGraph_s *pgraphIn, dglGraph_s *pgraphOut, dglInt32_t nVertex, dglSpanClip_fn fnClip, void *pvClipArg)
Definition graph_v2.c:78
void dgl_edge_t_release_V2(dglEdgeTraverser_s *pTraverser)
dglInt32_t * dgl_getnode_outedgeset_V2(dglGraph_s *pgraph, dglInt32_t *pnode)
long dglInt32_t
Definition type.h:24