1 (***********************************************************************)
5 (* Lucca Hirschi, LRI UMR8623 *)
6 (* Université Paris-Sud & CNRS *)
8 (* Copyright 2010-2012 Université Paris-Sud and Centre National de la *)
9 (* Recherche Scientifique. All rights reserved. This file is *)
10 (* distributed under the terms of the GNU Lesser General Public *)
11 (* License, with the special exception on linking described in file *)
14 (***********************************************************************)
16 (** Implementation of runs in ASTA and algorithms for computing them *)
19 (** The type of runs in ASTA *)
21 val compute : Tree.t -> Asta.t -> t
22 (** Gives the maximal run of an ASTA on a tree *)
24 val selected_nodes : Tree.t -> Asta.t -> int list
25 (** Gives a list of the positions (preorder) of selected nodes of a tree by
28 val print : Format.formatter -> t -> unit