]>
Commit | Line | Data |
---|---|---|
0e4d5753 | 1 | /* Binary relations. |
401b73af | 2 | Copyright (C) 2002, 2004, 2009 Free Software Foundation, Inc. |
0e4d5753 AD |
3 | |
4 | This file is part of Bison, the GNU Compiler Compiler. | |
5 | ||
f16b0819 | 6 | This program is free software: you can redistribute it and/or modify |
0e4d5753 | 7 | it under the terms of the GNU General Public License as published by |
f16b0819 PE |
8 | the Free Software Foundation, either version 3 of the License, or |
9 | (at your option) any later version. | |
0e4d5753 | 10 | |
f16b0819 | 11 | This program is distributed in the hope that it will be useful, |
0e4d5753 AD |
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. | |
15 | ||
16 | You should have received a copy of the GNU General Public License | |
f16b0819 | 17 | along with this program. If not, see <http://www.gnu.org/licenses/>. */ |
0e4d5753 AD |
18 | |
19 | ||
20 | #ifndef RELATION_H_ | |
21 | # define RELATION_H_ | |
22 | ||
23 | /* Performing operations on graphs coded as list of adjacency. | |
24 | ||
7b5cb0cd | 25 | If GRAPH is a relation, then GRAPH[Node] is a list of adjacent |
ed4cdb7a | 26 | nodes, ended with END_NODE. */ |
0e4d5753 | 27 | |
ed4cdb7a PE |
28 | #define END_NODE ((relation_node) -1) |
29 | ||
7886c2d4 | 30 | typedef size_t relation_node; |
7b5cb0cd PE |
31 | typedef relation_node *relation_nodes; |
32 | typedef relation_nodes *relation; | |
0e4d5753 AD |
33 | |
34 | ||
7b5cb0cd | 35 | /* Report a relation R that has SIZE vertices. */ |
88636fbd | 36 | void relation_print (relation r, relation_node size, FILE *out); |
0e4d5753 | 37 | |
7b5cb0cd PE |
38 | /* Compute the transitive closure of the FUNCTION on the relation R |
39 | with SIZE vertices. | |
0e4d5753 | 40 | |
7b5cb0cd PE |
41 | If R (NODE-1, NODE-2) then on exit FUNCTION[NODE - 1] was extended |
42 | (unioned) with FUNCTION[NODE - 2]. */ | |
88636fbd | 43 | void relation_digraph (relation r, relation_node size, bitsetv *function); |
0e4d5753 AD |
44 | |
45 | /* Destructively transpose *R_ARG, of size N. */ | |
88636fbd | 46 | void relation_transpose (relation *R_arg, relation_node n); |
0e4d5753 AD |
47 | |
48 | #endif /* ! RELATION_H_ */ |