/usr/lib/ocaml/ocamlgraph/rand.mli is in libocamlgraph-ocaml-dev 1.8.6-1+b2.
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 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 | (**************************************************************************)
(* *)
(* 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: rand.mli,v 1.12 2005-03-31 13:32:51 filliatr Exp $ *)
(** Random graph generation. *)
(** {2 Random graphs} *)
module type S = sig
type graph
type vertex
type edge_label
val graph : ?loops:bool -> v:int -> e:int -> unit -> graph
(** [graph v e] generates a random graph with exactly [v] vertices
and [e] edges. Vertices are labeled with [0] ... [v-1].
The boolean [loops] indicates whether loops are allowed;
default value is no loop ([false]).
@raise Invalid_argument if [e] exceeds the maximal number of edges. *)
val labeled :
(vertex -> vertex -> edge_label) ->
?loops:bool -> v:int -> e:int -> unit -> graph
(** [labeled f] is similar to [graph] except that edges are labeled
using function [f].
@raise Invalid_argument if there are too many edges. *)
(** The two functions above actually make a choice between two
different implementations according to the ratio e/(v*v).
When this ratio is small, [random_few_edges] is selected;
otherwise [random_many_edges] is selected. *)
val random_few_edges : loops:bool -> v:int -> e:int -> graph
val random_many_edges : loops:bool -> v:int -> e:int -> graph
val gnp : ?loops:bool -> v:int -> prob:float -> unit -> graph
(** random graph using the G(n,p) model.
[gnp v prob] generates a random graph with exactly [v] vertices
and where each edge is selected with probability [prob] *)
val gnp_labeled :
(vertex -> vertex -> edge_label) ->
?loops:bool -> v:int -> prob:float -> unit -> graph
(** [gnp_labeled add_edge v e] is similar to [gnp] except that edges
are labeled using function [f]. *)
end
module Make(B: Builder.INT) :
S with type graph = B.G.t
and type vertex = B.G.V.t
and type edge_label = B.G.E.label
(** Random graphs *)
module P (G : Sig.P with type V.label = int) :
S with type graph = G.t
and type vertex = G.V.t
and type edge_label = G.E.label
(** Random persistent graphs *)
module I (G : Sig.I with type V.label = int) :
S with type graph = G.t
and type vertex = G.V.t
and type edge_label = G.E.label
(** Random imperative graphs *)
(** {2 Random planar graphs} *)
module Planar : sig
module type S = sig
type graph
val graph :
?loops:bool -> xrange:int*int -> yrange:int*int ->
prob:float -> int -> graph
(** [graph xrange yrange prob v]
generates a random planar graph with exactly [v] vertices.
Vertices are labeled with integer coordinates, randomly distributed
according to [xrange] and [yrange].
Edges are built as follows: the full Delaunay triangulation is
constructed and then each edge is discarded with probabiblity [prob]
(which should lie in [0..1]). In particular [prob = 0.0] gives the
full triangulation.
Edges are labeled with the (rounded) Euclidean distance between
the two vertices.
The boolean [loops] indicates whether loops are allowed;
default value is no loop ([false]). *)
end
module Make
(B : Builder.S with type G.V.label = int * int and type G.E.label = int) :
S with type graph = B.G.t
(** Random planar graphs *)
module P (G : Sig.P with type V.label = int * int and type E.label = int) :
S with type graph = G.t
(** Random persistent planar graphs *)
module I (G : Sig.I with type V.label = int * int and type E.label = int) :
S with type graph = G.t
(** Random imperative planar graphs *)
end
|