1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
|
/* -*- mode: C -*- */
/*
IGraph library.
Copyright (C) 2009-2012 Gabor Csardi <csardi.gabor@gmail.com>
334 Harvard street, Cambridge, MA 02139 USA
This program is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 2 of the License, or
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program; if not, write to the Free Software
Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA
02110-1301 USA
*/
#ifndef IGRAPH_ADJLIST_H
#define IGRAPH_ADJLIST_H
#include "igraph_decls.h"
#include "igraph_constants.h"
#include "igraph_error.h"
#include "igraph_types.h"
#include "igraph_datatype.h"
__BEGIN_DECLS
typedef struct igraph_adjlist_t {
igraph_integer_t length;
igraph_vector_int_t *adjs;
} igraph_adjlist_t;
typedef struct igraph_inclist_t {
igraph_integer_t length;
igraph_vector_int_t *incs;
} igraph_inclist_t;
IGRAPH_EXPORT igraph_error_t igraph_adjlist_init(const igraph_t *graph, igraph_adjlist_t *al,
igraph_neimode_t mode, igraph_loops_t loops,
igraph_multiple_t multiple);
IGRAPH_EXPORT igraph_error_t igraph_adjlist_init_empty(igraph_adjlist_t *al, igraph_integer_t no_of_nodes);
IGRAPH_EXPORT igraph_integer_t igraph_adjlist_size(const igraph_adjlist_t *al);
IGRAPH_EXPORT igraph_error_t igraph_adjlist_init_complementer(const igraph_t *graph,
igraph_adjlist_t *al,
igraph_neimode_t mode,
igraph_bool_t loops);
IGRAPH_EXPORT igraph_error_t igraph_adjlist_init_from_inclist(
const igraph_t *graph, igraph_adjlist_t *al, const igraph_inclist_t *il);
IGRAPH_EXPORT void igraph_adjlist_destroy(igraph_adjlist_t *al);
IGRAPH_EXPORT void igraph_adjlist_clear(igraph_adjlist_t *al);
IGRAPH_EXPORT void igraph_adjlist_sort(igraph_adjlist_t *al);
IGRAPH_EXPORT igraph_error_t igraph_adjlist_simplify(igraph_adjlist_t *al);
IGRAPH_EXPORT igraph_error_t igraph_adjlist_print(const igraph_adjlist_t *al);
IGRAPH_EXPORT igraph_error_t igraph_adjlist_fprint(const igraph_adjlist_t *al, FILE *outfile);
IGRAPH_EXPORT igraph_bool_t igraph_adjlist_has_edge(igraph_adjlist_t* al, igraph_integer_t from, igraph_integer_t to, igraph_bool_t directed);
IGRAPH_EXPORT igraph_error_t igraph_adjlist_replace_edge(igraph_adjlist_t* al, igraph_integer_t from, igraph_integer_t oldto, igraph_integer_t newto, igraph_bool_t directed);
/**
* \define igraph_adjlist_get
* \brief Query a vector in an adjacency list.
*
* Returns a pointer to an <type>igraph_vector_int_t</type> object from an
* adjacency list. The vector can be modified as desired.
* \param al The adjacency list object.
* \param no The vertex whose adjacent vertices will be returned.
* \return Pointer to the <type>igraph_vector_int_t</type> object.
*
* Time complexity: O(1).
*/
#define igraph_adjlist_get(al,no) (&(al)->adjs[(igraph_integer_t)(no)])
IGRAPH_EXPORT igraph_error_t igraph_adjlist(igraph_t *graph, const igraph_adjlist_t *adjlist,
igraph_neimode_t mode, igraph_bool_t duplicate);
IGRAPH_EXPORT igraph_error_t igraph_inclist_init(const igraph_t *graph,
igraph_inclist_t *il,
igraph_neimode_t mode,
igraph_loops_t loops);
IGRAPH_EXPORT igraph_error_t igraph_inclist_init_empty(igraph_inclist_t *il, igraph_integer_t n);
IGRAPH_EXPORT igraph_integer_t igraph_inclist_size(const igraph_inclist_t *al);
IGRAPH_EXPORT void igraph_inclist_destroy(igraph_inclist_t *il);
IGRAPH_EXPORT void igraph_inclist_clear(igraph_inclist_t *il);
IGRAPH_EXPORT igraph_error_t igraph_inclist_print(const igraph_inclist_t *il);
IGRAPH_EXPORT igraph_error_t igraph_inclist_fprint(const igraph_inclist_t *il, FILE *outfile);
/**
* \define igraph_inclist_get
* \brief Query a vector in an incidence list.
*
* Returns a pointer to an <type>igraph_vector_int_t</type> object from an
* incidence list containing edge IDs. The vector can be modified,
* resized, etc. as desired.
* \param il Pointer to the incidence list.
* \param no The vertex for which the incident edges are returned.
* \return Pointer to an <type>igraph_vector_int_t</type> object.
*
* Time complexity: O(1).
*/
#define igraph_inclist_get(il,no) (&(il)->incs[(igraph_integer_t)(no)])
typedef struct igraph_lazy_adjlist_t {
const igraph_t *graph;
igraph_integer_t length;
igraph_vector_int_t **adjs;
igraph_neimode_t mode;
igraph_loops_t loops;
igraph_multiple_t multiple;
} igraph_lazy_adjlist_t;
IGRAPH_EXPORT igraph_error_t igraph_lazy_adjlist_init(const igraph_t *graph,
igraph_lazy_adjlist_t *al,
igraph_neimode_t mode,
igraph_loops_t loops,
igraph_multiple_t multiple);
IGRAPH_EXPORT void igraph_lazy_adjlist_destroy(igraph_lazy_adjlist_t *al);
IGRAPH_EXPORT void igraph_lazy_adjlist_clear(igraph_lazy_adjlist_t *al);
IGRAPH_EXPORT igraph_integer_t igraph_lazy_adjlist_size(const igraph_lazy_adjlist_t *al);
/**
* \define igraph_lazy_adjlist_has
* \brief Are adjacenct vertices already stored in a lazy adjacency list?
*
* \param al The lazy adjacency list.
* \param no The vertex ID to query.
* \return True if the adjacent vertices of this vertex are already computed
* and stored, false otherwise.
*
* Time complexity: O(1).
*/
#define igraph_lazy_adjlist_has(al,no) ((igraph_bool_t) (al)->adjs[(igraph_integer_t)(no)])
/**
* \define igraph_lazy_adjlist_get
* \brief Query neighbor vertices.
*
* If the function is called for the first time for a vertex then the
* result is stored in the adjacency list and no further query
* operations are needed when the neighbors of the same vertex are
* queried again.
*
* \param al The lazy adjacency list.
* \param no The vertex ID to query.
* \return Pointer to a vector, or \c NULL upon error. Errors can only
* occur the first time this function is called for a given vertex.
* It is safe to modify this vector,
* modification does not affect the original graph.
*
* \sa \ref igraph_lazy_adjlist_has() to check if this function has
* already been called for a vertex.
*
* Time complexity: O(d), the number of neighbor vertices for the
* first time, O(1) for subsequent calls.
*/
#define igraph_lazy_adjlist_get(al,no) \
(igraph_lazy_adjlist_has(al,no) ? ((al)->adjs[(igraph_integer_t)(no)]) \
: (igraph_i_lazy_adjlist_get_real(al, no)))
IGRAPH_EXPORT igraph_vector_int_t *igraph_i_lazy_adjlist_get_real(igraph_lazy_adjlist_t *al, igraph_integer_t no);
typedef struct igraph_lazy_inclist_t {
const igraph_t *graph;
igraph_integer_t length;
igraph_vector_int_t **incs;
igraph_neimode_t mode;
igraph_loops_t loops;
} igraph_lazy_inclist_t;
IGRAPH_EXPORT igraph_error_t igraph_lazy_inclist_init(const igraph_t *graph,
igraph_lazy_inclist_t *il,
igraph_neimode_t mode,
igraph_loops_t loops);
IGRAPH_EXPORT void igraph_lazy_inclist_destroy(igraph_lazy_inclist_t *il);
IGRAPH_EXPORT void igraph_lazy_inclist_clear(igraph_lazy_inclist_t *il);
IGRAPH_EXPORT igraph_integer_t igraph_lazy_inclist_size(const igraph_lazy_inclist_t *il);
/**
* \define igraph_lazy_inclist_has
* \brief Are incident edges already stored in a lazy inclist?
*
* \param il The lazy incidence list.
* \param no The vertex ID to query.
* \return True if the incident edges of this vertex are already computed
* and stored, false otherwise.
*
* Time complexity: O(1).
*/
#define igraph_lazy_inclist_has(il,no) ((igraph_bool_t) (il)->incs[(igraph_integer_t)(no)])
/**
* \define igraph_lazy_inclist_get
* \brief Query incident edges.
*
* If the function is called for the first time for a vertex, then the
* result is stored in the incidence list and no further query
* operations are needed when the incident edges of the same vertex are
* queried again.
*
* \param il The lazy incidence list object.
* \param no The vertex ID to query.
* \return Pointer to a vector, or \c NULL upon error. Errors can only
* occur the first time this function is called for a given vertex.
* It is safe to modify this vector,
* modification does not affect the original graph.
*
* \sa \ref igraph_lazy_inclist_has() to check if this function has
* already been called for a vertex.
*
* Time complexity: O(d), the number of incident edges for the first
* time, O(1) for subsequent calls with the same \p no argument.
*/
#define igraph_lazy_inclist_get(il,no) \
(igraph_lazy_inclist_has(il,no) ? ((il)->incs[(igraph_integer_t)(no)]) \
: (igraph_i_lazy_inclist_get_real(il,no)))
IGRAPH_EXPORT igraph_vector_int_t *igraph_i_lazy_inclist_get_real(igraph_lazy_inclist_t *il, igraph_integer_t no);
__END_DECLS
#endif
|
