| 1 | /* Binary relations. |
| 2 | Copyright (C) 2002 Free Software Foundation, Inc. |
| 3 | |
| 4 | This file is part of Bison, the GNU Compiler Compiler. |
| 5 | |
| 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) |
| 9 | any later version. |
| 10 | |
| 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. |
| 15 | |
| 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., 59 Temple Place - Suite 330, |
| 19 | Boston, MA 02111-1307, USA. */ |
| 20 | |
| 21 | |
| 22 | #ifndef RELATION_H_ |
| 23 | # define RELATION_H_ |
| 24 | |
| 25 | /* Performing operations on graphs coded as list of adjacency. |
| 26 | |
| 27 | If GRAPH is a relation_t, then GRAPH[Node] is a list of adjacent |
| 28 | nodes, ended with -1. */ |
| 29 | |
| 30 | typedef short relation_node_t; |
| 31 | typedef relation_node_t *relation_nodes_t; |
| 32 | typedef relation_nodes_t *relation_t; |
| 33 | |
| 34 | |
| 35 | /* Report a RELATION that has SIZE vertices. */ |
| 36 | void relation_print (relation_t relatio, size_t size, FILE *out); |
| 37 | |
| 38 | /* Compute the transitive closure of the FUNCTION on the RELATION with |
| 39 | SIZE vertices. |
| 40 | |
| 41 | If RELATION (NODE-1, NODE-2) then on exit FUNCTION[NODE-1] was |
| 42 | extended (unioned) with FUNCTION[NODE-2]. */ |
| 43 | void relation_digraph (relation_t relation, size_t size, bitsetv *function); |
| 44 | |
| 45 | /* Destructively transpose *R_ARG, of size N. */ |
| 46 | void relation_transpose (relation_t *R_arg, int n); |
| 47 | |
| 48 | #endif /* ! RELATION_H_ */ |