This file is indexed.

/usr/include/spooles/BPG/BPG.h is in libspooles-dev 2.2-10build1.

This file is owned by root:root, with mode 0o644.

The actual contents of the file can be viewed below.

  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
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
/*  BPG.h  */

#include "../Graph.h"
#include "../cfiles.h"

/*--------------------------------------------------------------------*/
/*
   ----------------------------------------------
   the BPG object holds a bipartite graph.
   the edge set E \subseteq X \times Y,
   where X and Y are two sets of vertices,
      X = { 0, 1, ..., nX - 1}
      Y = { nX, nX + 1, ..., nX + nY - 1 }

   the BPG object contains a Graph object graph,
   a hack because C does not possess inheritance.

   created -- 95oct06, cca
   ----------------------------------------------
*/
typedef struct _BPG   BPG ;
struct _BPG {
   int     nX       ;
   int     nY       ;
   Graph   *graph   ;
} ;
/*--------------------------------------------------------------------*/
/*
------------------------------------------------------------------------
----- methods found in basics.c ----------------------------------------
------------------------------------------------------------------------
*/
/*
   -----------------------------------------------
   purpose -- create and return a new BPG object

   created -- 95oct06, cca
   -----------------------------------------------
*/
BPG *
BPG_new ( 
   void
) ;
/*
   ------------------------------------------------------
   purpose -- set the default fields for the BPG object

   created -- 95oct06, cca
   ------------------------------------------------------
*/
void
BPG_setDefaultFields (
   BPG   *bpg
) ;
/*
   --------------------------------
   purpose -- clear the data fields

   created -- 95oct06, cca
   --------------------------------
*/
void
BPG_clearData (
   BPG   *bpg
) ;
/*
   --------------------------------
   purpose -- free the BPG object

   created -- 95oct06, cca
   --------------------------------
*/
void
BPG_free (
   BPG   *bpg
) ;
/*--------------------------------------------------------------------*/
/*
------------------------------------------------------------------------
----- methods found in DM.c --------------------------------------------
------------------------------------------------------------------------
*/
/*
   ---------------------------------------------------------
   compute the generalized Dulmadge-Mendolsohn decomposition

   bpg     -- BPG bipartite graph object
   dmflags -- flags vector
                   / 0 if x in X_R
      dmflags[x] = | 1 if x in X_I
                   \ 2 if x in X_E
                   / 0 if y in Y_R
      dmflags[y] = | 1 if y in Y_I
                   \ 2 if y in Y_E
   stats -- statistics vector
      stats[0] -- weight of X_I
      stats[1] -- weight of X_E
      stats[2] -- weight of X_R
      stats[3] -- weight of Y_I
      stats[4] -- weight of Y_E
      stats[5] -- weight of Y_R

   created -- 95oct12, cca
   ---------------------------------------------------------
*/
void
BPG_DMdecomposition (
   BPG    *bpg,
   int    dmflags[],
   int    stats[],
   int    msglvl,
   FILE   *msgFile
) ;
/*--------------------------------------------------------------------*/
/*
------------------------------------------------------------------------
----- methods found in maxFlow.c ---------------------------------------
------------------------------------------------------------------------
*/
/*
   -------------------------------------------------------
   find the DM decomposition of a weighted bipartite graph
   using a simple max flow algorithm
 
   bpg     -- BPG bipartite graph object
   dmflags -- flags vector
                   / 0 if x in X_R
      dmflags[x] = | 1 if x in X_I
                   \ 2 if x in X_E
                   / 0 if y in Y_R
      dmflags[y] = | 1 if y in Y_I
                   \ 2 if y in Y_E
   stats -- statistics vector
      stats[0] -- weight of X_I
      stats[1] -- weight of X_E
      stats[2] -- weight of X_R
      stats[3] -- weight of Y_I
      stats[4] -- weight of Y_E
      stats[5] -- weight of Y_R
 
   created -- 96mar08, cca
   -------------------------------------------------------
*/
void
BPG_DMviaMaxFlow (
   BPG    *bpg,
   int    dmflags[],
   int    stats[],
   int    msglvl,
   FILE   *msgFile
) ;
/*--------------------------------------------------------------------*/
/*
------------------------------------------------------------------------
----- methods found in init.c ------------------------------------------
------------------------------------------------------------------------
*/
/*
   --------------------------------------------------------------------
   initialize a BPG object, set bpg->nX = nX, bpg->nY = nY,
   and bpg->graph = graph. convert graph into bipartite form, i.e.,
      adj(v) := adj(v) \cap {nX, ..., nX + nY - 1} for v in [0, nX)
      adj(v) := adj(v) \cap {0, ..., nX - 1}       for v in [nX, nX+nY)

   created -- 95oct06, cca
   --------------------------------------------------------------------
*/
void
BPG_init (
   BPG     *bpg,
   int     nX,
   int     nY,
   Graph   *graph
) ;
/*
   -----------------------------------------------------------
   initialize from a graph given a color vector and two target
   vectors. this method can be used to get the bipartite graph
   of the boundary of two components.

   graph  -- graph from which to extract the bipartite graph
   colors -- vector of colors for the vertices
   cX     -- color for the X vertices
   cY     -- color for the Y vertices
   cmap   -- map from vertices in g to vertices in bpg
   indX   -- vector to hold the global indices in X
   indY   -- vector to hold the global indices in Y

   created -- 95oct06, cca
   -----------------------------------------------------------
*/
void
BPG_initFromColoring (
   BPG     *bpg,
   Graph   *graph,
   int     colors[],
   int     cX,
   int     cY,
   int     cmap[],
   int     indX[],
   int     indY[]
) ;
/*--------------------------------------------------------------------*/
/*
------------------------------------------------------------------------
----- methods found in IO.c --------------------------------------------
------------------------------------------------------------------------
*/
/*
   ----------------------------------------------
   purpose -- to read in a BPG object from a file

   input --

      fn -- filename, must be *.bpgb or *.bpgf

   return value -- 1 if success, 0 if failure

   created -- 95oct06, cca
   ----------------------------------------------
*/
int
BPG_readFromFile ( 
   BPG    *bpg, 
   char   *fn 
) ;
/*
   --------------------------------------------------------
   purpose -- to read a BPG object from a formatted file

   return value -- 1 if success, 0 if failure

   created -- 95oct06, cca
   --------------------------------------------------------
*/
int
BPG_readFromFormattedFile ( 
   BPG   *bpg, 
   FILE    *fp 
) ;
/*
   ----------------------------------------------------
   purpose -- to read a BPG object from a binary file

   return value -- 1 if success, 0  if failure

   created -- 95oct06, cca
   ----------------------------------------------------
*/
int
BPG_readFromBinaryFile ( 
   BPG   *bpg, 
   FILE    *fp 
) ;
/*
   --------------------------------------------
   purpose -- to write a BPG object to a file

   input --

      fn -- filename
        *.bpgb -- binary
        *.bpgf -- formatted
        anything else -- for human eye

   return value -- 1 if success, 0 otherwise

   created -- 95oct06, cca
   --------------------------------------------
*/
int
BPG_writeToFile ( 
   BPG   *bpg, 
   char    *fn 
) ;
/*
   ------------------------------------------------------
   purpose -- to write a BPG object to a formatted file

   return value -- 1 if success, 0 otherwise

   created -- 95oct06, cca
   ------------------------------------------------------
*/
int
BPG_writeToFormattedFile ( 
   BPG   *bpg, 
   FILE  *fp 
) ;
/*
   ---------------------------------------------------
   purpose -- to write a BPG object to a binary file

   return value -- 1 if success, 0 otherwise

   created -- 95oct06, cca
   ---------------------------------------------------
*/
int
BPG_writeToBinaryFile ( 
   BPG    *bpg, 
   FILE   *fp 
) ;
/*
   -------------------------------------------------
   purpose -- to write a BPG object for a human eye

   return value -- 1 if success, 0 otherwise

   created -- 95oct06, cca
   -------------------------------------------------
*/
int
BPG_writeForHumanEye ( 
   BPG    *bpg, 
   FILE   *fp 
) ;
/*
   -----------------------------------------------------------
   purpose -- to write out the statistics for the BPG object

   return value -- 1 if success, 0 otherwise

   created -- 95oct06, cca
   -----------------------------------------------------------
*/
int
BPG_writeStats ( 
   BPG    *bpg, 
   FILE   *fp 
) ;
/*--------------------------------------------------------------------*/
/*
------------------------------------------------------------------------
----- methods found in makeGraphs.c ------------------------------------
------------------------------------------------------------------------
*/
/*
   -----------------------------------------------------------
   purpose -- return the X by X graph where (x1,x2) is an edge
              if there exists a y in Y such that (x1,y) and
              (x2,y) are edges in the bipartite graph.

   created -- 95dec06, cca
              to be used in the BKL object.
   -----------------------------------------------------------
*/
Graph *
BPG_makeGraphXbyX (
   BPG   *bpg
) ;
/*
   -----------------------------------------------------------
   purpose -- return the Y by Y graph where (y1,y2) is an edge
              if there exists a x in X such that (x,y1) and
              (x,y2) are edges in the bipartite graph.

   created -- 95dec07, cca
   -----------------------------------------------------------
*/
Graph *
BPG_makeGraphYbyY (
   BPG   *bpg
) ;
/*--------------------------------------------------------------------*/
/*
------------------------------------------------------------------------
----- methods found in pseudo.c ----------------------------------------
------------------------------------------------------------------------
*/
/*
   ------------------------------
   return a pseudoperipheral node

   created -- 95oct07, cca
   ------------------------------
*/
int
BPG_pseudoperipheralnode (
   BPG   *bpg,
   int   seed
) ;
/*
   ----------------------------------------------------
   return value -- # of vertices in the level structure

   created -- 95oct07, cca
   ----------------------------------------------------
*/
int
BPG_levelStructure (
   BPG   *bpg,
   int   root,
   int   list[],
   int   dist[],
   int   mark[],
   int   tag
) ;
/*--------------------------------------------------------------------*/