/* Binary relations.
- Copyright (C) 2002 Free Software Foundation, Inc.
+ Copyright (C) 2002, 2004 Free Software Foundation, Inc.
This file is part of Bison, the GNU Compiler Compiler.
/* Performing operations on graphs coded as list of adjacency.
- If GRAPH is a relation_t, then GRAPH[Node] is a list of adjacent
- nodes, ended with -1. */
+ If GRAPH is a relation, then GRAPH[Node] is a list of adjacent
+ nodes, ended with END_NODE. */
-typedef short relation_node_t;
-typedef relation_node_t *relation_nodes_t;
-typedef relation_nodes_t *relation_t;
+#define END_NODE ((relation_node) -1)
+typedef size_t relation_node;
+typedef relation_node *relation_nodes;
+typedef relation_nodes *relation;
-/* Report a RELATION that has SIZE vertices. */
-void relation_print (relation_t relatio, size_t size, FILE *out);
-/* Compute the transitive closure of the FUNCTION on the RELATION with
- SIZE vertices.
+/* Report a relation R that has SIZE vertices. */
+void relation_print (relation r, relation_node size, FILE *out);
- If RELATION (NODE-1, NODE-2) then on exit FUNCTION[NODE-1] was
- extended (unioned) with FUNCTION[NODE-2]. */
-void relation_digraph (relation_t relation, size_t size, bitsetv *function);
+/* Compute the transitive closure of the FUNCTION on the relation R
+ with SIZE vertices.
+
+ If R (NODE-1, NODE-2) then on exit FUNCTION[NODE - 1] was extended
+ (unioned) with FUNCTION[NODE - 2]. */
+void relation_digraph (relation r, relation_node size, bitsetv *function);
/* Destructively transpose *R_ARG, of size N. */
-void relation_transpose (relation_t *R_arg, int n);
+void relation_transpose (relation *R_arg, relation_node n);
#endif /* ! RELATION_H_ */