Chris@19: (*
Chris@19:  * Copyright (c) 1997-1999 Massachusetts Institute of Technology
Chris@19:  * Copyright (c) 2003, 2007-14 Matteo Frigo
Chris@19:  * Copyright (c) 2003, 2007-14 Massachusetts Institute of Technology
Chris@19:  *
Chris@19:  * This program is free software; you can redistribute it and/or modify
Chris@19:  * it under the terms of the GNU General Public License as published by
Chris@19:  * the Free Software Foundation; either version 2 of the License, or
Chris@19:  * (at your option) any later version.
Chris@19:  *
Chris@19:  * This program is distributed in the hope that it will be useful,
Chris@19:  * but WITHOUT ANY WARRANTY; without even the implied warranty of
Chris@19:  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
Chris@19:  * GNU General Public License for more details.
Chris@19:  *
Chris@19:  * You should have received a copy of the GNU General Public License
Chris@19:  * along with this program; if not, write to the Free Software
Chris@19:  * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA  02110-1301  USA
Chris@19:  *
Chris@19:  *)
Chris@19: 
Chris@19: open Util
Chris@19: 
Chris@19: type color = | RED | BLUE | BLACK | YELLOW
Chris@19: 
Chris@19: type dagnode = 
Chris@19:     { assigned: Variable.variable;
Chris@19:       mutable expression: Expr.expr;
Chris@19:       input_variables: Variable.variable list;
Chris@19:       mutable successors: dagnode list;
Chris@19:       mutable predecessors: dagnode list;
Chris@19:       mutable label: int;
Chris@19:       mutable color: color}
Chris@19: 
Chris@19: type dag
Chris@19: 
Chris@19: val makedag : (Variable.variable * Expr.expr) list -> dag
Chris@19: 
Chris@19: val map : (dagnode -> dagnode) -> dag -> dag
Chris@19: val for_all : dag -> (dagnode -> unit) -> unit
Chris@19: val to_list : dag -> (dagnode list)
Chris@19: val bfs : dag -> dagnode -> int -> unit
Chris@19: val find_node : (dagnode -> bool) -> dag -> dagnode option