2 Copyright (C) 2002, 2004 Free Software Foundation, Inc.
4 This file is part of Bison, the GNU Compiler Compiler.
6 Bison is free software; you can redistribute it and/or modify
7 it under the terms of the GNU General Public License as published by
8 the Free Software Foundation; either version 2, or (at your option)
11 Bison is distributed in the hope that it will be useful,
12 but WITHOUT ANY WARRANTY; without even the implied warranty of
13 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 GNU General Public License for more details.
16 You should have received a copy of the GNU General Public License
17 along with Bison; see the file COPYING. If not, write to
18 the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor,
19 Boston, MA 02110-1301, USA. */
25 /* Performing operations on graphs coded as list of adjacency.
27 If GRAPH is a relation, then GRAPH[Node] is a list of adjacent
28 nodes, ended with END_NODE. */
30 #define END_NODE ((relation_node) -1)
32 typedef size_t relation_node
;
33 typedef relation_node
*relation_nodes
;
34 typedef relation_nodes
*relation
;
37 /* Report a relation R that has SIZE vertices. */
38 void relation_print (relation r
, relation_node size
, FILE *out
);
40 /* Compute the transitive closure of the FUNCTION on the relation R
43 If R (NODE-1, NODE-2) then on exit FUNCTION[NODE - 1] was extended
44 (unioned) with FUNCTION[NODE - 2]. */
45 void relation_digraph (relation r
, relation_node size
, bitsetv
*function
);
47 /* Destructively transpose *R_ARG, of size N. */
48 void relation_transpose (relation
*R_arg
, relation_node n
);
50 #endif /* ! RELATION_H_ */