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