/usr/lib/ocaml/ocamlgraph/kruskal.mli is in libocamlgraph-ocaml-dev 1.8.6-1build5.
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 | (**************************************************************************)
(* *)
(* Ocamlgraph: a generic graph library for OCaml *)
(* Copyright (C) 2004-2010 *)
(* Sylvain Conchon, Jean-Christophe Filliatre and Julien Signoles *)
(* *)
(* This software is free software; you can redistribute it and/or *)
(* modify it under the terms of the GNU Library General Public *)
(* License version 2.1, with the special exception on linking *)
(* described in file LICENSE. *)
(* *)
(* This software 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. *)
(* *)
(**************************************************************************)
(* $Id: kruskal.mli,v 1.5 2005-06-30 10:48:55 filliatr Exp $ *)
(** Kruskal's minimum-spanning-tree algorithm. *)
(** Minimal graph signature for Kruskal.
Sub-signature of {!Sig.G}. *)
module type G = sig
type t
module V : Sig.COMPARABLE
module E : sig
type t
type label
val label : t -> label
val dst : t -> V.t
val src : t -> V.t
end
val fold_vertex : (V.t -> 'a -> 'a) -> t -> 'a -> 'a
val iter_edges_e : (E.t -> unit) -> t -> unit
end
(** Functor providing an implementation of Kruskal's minimum-spanning-tree
algorithm.
Parameter [W] ensures that label on edges are comparable. *)
module Make(G: G)(W: Sig.ORDERED_TYPE with type t = G.E.label) : sig
val spanningtree : G.t -> G.E.t list
end
(** {2 Generic version where union-find implementation is provided} *)
(** Signature of union-find. *)
module type UNIONFIND = sig
type elt
type t
val init : elt list -> t
val find : elt -> t -> elt
val union : elt -> elt -> t -> unit
end
(** Functor providing an implementation of Kruskal's minimum-spanning-tree
algorithm using a user-defined union-find algorithm.
Parameter [W] ensures that label on edges are comparable. *)
module Generic
(G: G)
(W: Sig.ORDERED_TYPE with type t = G.E.label)
(UF: UNIONFIND with type elt = G.V.t) :
sig
val spanningtree : G.t -> G.E.t list
end
|