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 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., 51 Franklin Street, Fifth Floor, 19 Boston, MA 02110-1301, 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, then GRAPH[Node] is a list of adjacent 28 nodes, ended with END_NODE. */ 29 30 #define END_NODE ((relation_node) -1) 31 32 typedef size_t relation_node; 33 typedef relation_node *relation_nodes; 34 typedef relation_nodes *relation; 35 36 37 /* Report a relation R that has SIZE vertices. */ 38 void relation_print (relation r, relation_node size, FILE *out); 39 40 /* Compute the transitive closure of the FUNCTION on the relation R 41 with SIZE vertices. 42 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); 46 47 /* Destructively transpose *R_ARG, of size N. */ 48 void relation_transpose (relation *R_arg, relation_node n); 49 50 #endif /* ! RELATION_H_ */ 51