/usr/lib/ocaml/ocamlgraph/oper.mli is in libocamlgraph-ocaml-dev 1.8.3-1build1.
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 123 124 | (**************************************************************************)
(* *)
(* 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. *)
(* *)
(**************************************************************************)
(** Basic operations over graphs *)
(** {2 Basic operations over graphs} *)
module type S = sig
type g
val transitive_closure : ?reflexive:bool -> g -> g
(** [transitive_closure ?reflexive g] returns the transitive closure
of [g] (as a new graph). Loops (i.e. edges from a vertex to itself)
are added only if [reflexive] is [true] (default is [false]). *)
val add_transitive_closure : ?reflexive:bool -> g -> g
(** [add_transitive_closure ?reflexive g] replaces [g] by its
transitive closure. Meaningless for persistent implementations
(then acts as [transitive_closure]). *)
val mirror : g -> g
(** [mirror g] returns a new graph which is the mirror image of [g]:
each edge from [u] to [v] has been replaced by an edge from [v] to [u].
For undirected graphs, it simply returns [g].
Note: Vertices are shared between [g] and [mirror g]; you may need to
make a copy of [g] before using [mirror] *)
val complement : g -> g
(** [complement g] returns a new graph which is the complement of [g]:
each edge present in [g] is not present in the resulting graph and
vice-versa. Edges of the returned graph are unlabeled. *)
val intersect : g -> g -> g
(** [intersect g1 g2] returns a new graph which is the intersection of [g1]
and [g2]: each vertex and edge present in [g1] *and* [g2] is present
in the resulting graph. *)
val union : g -> g -> g
(** [union g1 g2] returns a new graph which is the union of [g1] and [g2]:
each vertex and edge present in [g1] *or* [g2] is present in the
resulting graph. *)
end
module Make(B : Builder.S) : S with type g = B.G.t
(** Basic operations over graphs *)
module P(G : Sig.P) : S with type g = G.t
(** Basic operations over persistent graphs *)
module I(G : Sig.I) : S with type g = G.t
(** Basic operations over imperative graphs *)
(** {2 Choose} *)
(** Choose an element in a graph *)
module Choose(G : sig
type t
type vertex
type edge
val iter_vertex : (vertex -> unit) -> t -> unit
val iter_edges_e : (edge -> unit) -> t -> unit
end) :
sig
val choose_vertex : G.t -> G.vertex
(** [choose_vertex g] returns a vertex from the graph.
@raise Invalid_argument if the graph is empty. *)
val choose_edge : G.t -> G.edge
(** [choose_edge g] returns an edge from the graph.
@raise Invalid_argument if the graph has no edge. *)
end
(** {2 Neighbourhood} *)
(** Neighbourhood of vertex / vertices *)
module Neighbourhood(G : sig
type t
module V : Sig.COMPARABLE
val fold_succ: (V.t -> 'a -> 'a) -> t -> V.t -> 'a -> 'a
val succ: t -> V.t -> V.t list
end) :
sig
module Vertex_Set : Set.S with type elt = G.V.t
(** The neighbourhood of a vertex [v] is
\{ v' | (succ g v) and (v <> v') \} *)
val list_from_vertex : G.t -> G.V.t -> G.V.t list
(** Neighbourhood of a vertex as a list. *)
val set_from_vertex : G.t -> G.V.t -> Vertex_Set.t
(** Neighbourhood of a vertex as a set.
Less efficient that [list_from_vertex]. *)
(** The neighbourhood of a set [S] of vertices is [U \ S] where
[U] is the union of neighbourhoods of each vertex of [S]. *)
val list_from_vertices : G.t -> G.V.t list -> G.V.t list
(** Neighbourhood of a list of vertices as a list. *)
val set_from_vertices : G.t -> G.V.t list -> Vertex_Set.t
(** Neighbourhood of a list of vertices as a set.
More efficient that [list_from_vertices]. *)
end
|