(***********************************************************************)
(*                                                                     *)
(*                               TAToo                                 *)
(*                                                                     *)
(*                   Lucca Hirschi, LRI UMR8623                        *)
(*                   Université Paris-Sud & CNRS                       *)
(*                                                                     *)
(*  Copyright 2010-2012 Université Paris-Sud and Centre National de la *)
(*  Recherche Scientifique. All rights reserved.  This file is         *)
(*  distributed under the terms of the GNU Lesser General Public       *)
(*  License, with the special exception on linking described in file   *)
(*  ../LICENSE.                                                        *)
(*                                                                     *)
(***********************************************************************)

(** Implementation of runs in ASTA and algorithms for computing them *)

type t
(** The type of runs in ASTA *)

val compute : Tree.t -> Asta.t -> t
(** Gives the maximal run of an ASTA on a tree *)

val selected_nodes : Tree.t -> Asta.t -> int list
(** Gives a list of the positions (preorder) of selected nodes of a tree by
    an ASTA *)

val print : Format.formatter -> t -> unit
(** Pretty printer *)