/usr/include/rheolef/degree.h is in librheolef-dev 5.93-2.
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 | #ifndef _DEGREE_H
#define _DEGREE_H
/// This file is part of Rheolef.
///
/// Copyright (C) 2000-2009 Pierre Saramito <Pierre.Saramito@imag.fr>
///
/// Rheolef 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.
///
/// Rheolef 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 Rheolef; if not, write to the Free Software
/// Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
///
/// =========================================================================
/* degree.f -- translated by f2c (version 19931217).*/
/*****************************************************************/
/********* DEGREE ..... DEGREE IN MASKED COMPONENT *********/
/*****************************************************************/
/* PURPOSE - THIS ROUTINE COMPUTES THE DEGREES OF THE NODES*/
/* IN THE CONNECTED COMPONENT SPECIFIED BY MASK AND ROOT*/
/* NODES FOR WHICH MASK IS ZERO ARE IGNORED.*/
/* INPUT PARAMETER -*/
/* ROOT - IS THE INPUT NODE THAT DEFINES THE COMPONENT.*/
/* (XADJ, ADJNCY) - ADJACENCY STRUCTURE PAIR.*/
/* MASK - SPECIFIES A SECTION SUBGRAPH.*/
/* OUTPUT PARAMETERS -*/
/* DEG - ARRAY CONTAINING THE DEGREES OF THE NODES IN*/
/* THE COMPONENT.*/
/* CCSIZE-SIZE OF THE COMPONENT SPECIFED BY MASK AND ROOT*/
/* WORKING PARAMETER -*/
/* LS - A TEMPORARY VECTOR USED TO STORE THE NODES OF THE*/
/* COMPONENT LEVEL BY LEVEL.*/
/*****************************************************************/
namespace rheolef {
template <class Iterator>
void
degree(
Iterator root,
Iterator xadj,
Iterator adjncy,
Iterator mask,
Iterator deg,
Iterator ccsize,
Iterator ls)
{
typedef typename std::iterator_traits<Iterator>::value_type Integer;
/* System generated locals */
Integer i__1, i__2;
/* Local variables */
static Integer ideg, node, i, j, jstop, jstrt, lbegin, lvlend, lvsize,
nbr;
/* INITIALIZATION ...*/
/* THE ARRAY XADJ IS USED AS A TEMPORARY MARKER TO*/
/* INDICATE WHICH NODES HAVE BEEN CONSIDERED SO FAR.*/
/* Parameter adjustments */
--ls;
--deg;
--mask;
--adjncy;
--xadj;
ls[1] = *root;
xadj[*root] = -xadj[*root];
lvlend = 0;
*ccsize = 1;
/* LBEGIN IS THE POINTER TO THE BEGINNING OF THE CURRENT*/
/* LEVEL, AND LVLEND POINTS TO THE END OF THIS LEVEL.*/
L100:
lbegin = lvlend + 1;
lvlend = *ccsize;
/* FIND THE DEGREES OF NODES IN THE CURRENT LEVEL,*/
/* AND AT THE SAME TIME, GENERATE THE NEXT LEVEL.*/
i__1 = lvlend;
for (i = lbegin; i <= i__1; ++i) {
node = ls[i];
jstrt = -xadj[node];
jstop = (i__2 = xadj[node + 1], (Integer)(i__2 > 0 ? i__2 : -i__2)) - 1;
ideg = 0;
if (jstop < jstrt) {
goto L300;
}
i__2 = jstop;
for (j = jstrt; j <= i__2; ++j) {
nbr = adjncy[j];
if (mask[nbr] == 0) {
goto L200;
}
++ideg;
if (xadj[nbr] < 0) {
goto L200;
}
xadj[nbr] = -xadj[nbr];
++(*ccsize);
ls[*ccsize] = nbr;
L200:
;
}
L300:
deg[node] = ideg;
}
/* COMPUTE THE CURRENT LEVEL WIDTH. */
/* IF IT IS NONZERO , GENERATE ANOTHER LEVEL.*/
lvsize = *ccsize - lvlend;
if (lvsize > 0) {
goto L100;
}
/* RESET XADJ TO ITS CORRECT SIGN AND RETURN. */
/* ------------------------------------------*/
i__1 = *ccsize;
for (i = 1; i <= i__1; ++i) {
node = ls[i];
xadj[node] = -xadj[node];
}
}
}// namespace rheolef
#endif // _DEGREE_H
|