/usr/lib/ocaml/ocamlgraph/dGraphSubTree.mli is in libocamlgraph-ocaml-dev 1.8.6-1build2.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 | (**************************************************************************)
(* *)
(* This file is part of OcamlGraph. *)
(* *)
(* Copyright (C) 2009-2010 *)
(* CEA (Commissariat à l'Énergie Atomique) *)
(* *)
(* you can redistribute it and/or modify it under the terms of the GNU *)
(* Lesser General Public License as published by the Free Software *)
(* Foundation, version 2.1, with a linking exception. *)
(* *)
(* It is distributed in the hope that it will be useful, *)
(* but WITHOUT ANY WARRANTY; without even the implied warranty of *)
(* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the *)
(* GNU Lesser General Public License for more details. *)
(* *)
(* See the file ../LICENSE for more details. *)
(* *)
(* Authors: *)
(* - Julien Signoles (Julien.Signoles@cea.fr) *)
(* - Jean-Denis Koeck (jdkoeck@gmail.com) *)
(* - Benoit Bataille (benoit.bataille@gmail.com) *)
(* *)
(**************************************************************************)
open Graph
module type G = sig
type t
module V : sig
type t
type label
val label : t -> label
val hash : t -> int
val equal : t -> t -> bool
end
module E : sig
type t
end
val iter_succ : (V.t -> unit) -> t -> V.t -> unit
val iter_pred : (V.t -> unit) -> t -> V.t -> unit
val find_edge : t -> V.t -> V.t -> E.t
end
module type Tree = sig
type t
module V : sig
type t
type label
val create : label -> t
val label : t -> label
val hash : t -> int
val equal : t -> t -> bool
end
module E : Sig.EDGE with type vertex = V.t
val create : ?size:int -> unit -> t
val add_vertex : t -> V.t -> unit
val add_edge_e : t -> E.t -> unit
end
module type S = sig
module Tree: Tree with type E.label = unit
type t
val get_structure : t -> Tree.t
val get_root : t -> Tree.V.t
val get_tree_vertices : Tree.V.label -> t -> Tree.V.t list
val is_ghost_node : Tree.V.t -> t -> bool
val is_ghost_edge : Tree.E.t -> t -> bool
exception Ghost_node
val get_graph_vertex : Tree.V.t -> t -> Tree.V.label
end
module Make
(G : G)
(Tree : Tree with type V.label = G.V.t and type E.label = unit) :
sig
include S with module Tree = Tree
val make : G.t -> G.V.t -> int -> int -> t
end
module Make_from_dot_model
(Tree : Tree with type V.label = DGraphModel.DotG.V.t
and type E.label = unit) :
sig
include S with module Tree = Tree
val make:
(Tree.V.label, DGraphModel.DotG.E.t, string) DGraphModel.abstract_model ->
Tree.V.label -> int -> int -> t
end
|