/usr/lib/ocaml/ocamlgraph/mcs_m.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 | (**************************************************************************)
(* *)
(* 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: mcs_m.mli,v 1.2 2004-10-19 15:21:44 signoles Exp $ *)
(** Maximal Cardinality Search (MCS-M) algorithm
Based on the article:
Maximal Cardinality Search for Computing Minimal Triangulations of Graphs.
by A. Berry, Jean R. S. Blair, Pinar Heggernes & Barry W. Peyton.
@author Matthieu Sozeau
@author Pierre-Loic Garoche *)
module MaximalCardinalitySearch : sig
module P(G : Sig.P) : sig
type edgelist = (G.V.t * G.V.t) list
(** [mcsm g] returns a tuple [(o, e)] where [o] is a perfect elimination
order of [g'] where [g'] is the triangulation [e] applied to [g]. *)
val mcsm : G.t -> (int * G.V.t) list * edgelist
(** [triangulate g] computes a triangulation of [g]
using the MCS-M algorithm *)
val triangulate : G.t -> G.t
end
module I(Gr : Sig.I) : sig
type edgelist = (Gr.V.t * Gr.V.t) list
(** [mcsm g] return a tuple [(o, e)] where o is a perfect elimination order
of [g'] where [g'] is the triangulation [e] applied to [g]. *)
val mcsm : Gr.t -> (int * Gr.V.t) list * edgelist
(** [triangulate g] triangulates [g] using the MCS-M algorithm *)
val triangulate : Gr.t -> unit
end
end
|