/usr/lib/ocaml/oasis/OASISGraph.ml is in liboasis-ocaml-dev 0.3.0-4.
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 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 | type vertex = int
module SetInt =
Set.Make
(struct
type t = int
let compare = ( - )
end)
type 'a t =
{
mutable vertexes: ('a * SetInt.t ref) array;
values: ('a, int) Hashtbl.t;
}
let create len =
{
vertexes = [||];
values = Hashtbl.create len;
}
let copy t =
{
vertexes = Array.copy t.vertexes;
values = Hashtbl.copy t.values;
}
let value_of_vertex t v =
if 0 <= v && v < Array.length t.vertexes then
fst (Array.unsafe_get t.vertexes v)
else
invalid_arg "get_vertex"
let vertex_of_value t e =
Hashtbl.find t.values e
let add_vertex t e =
if Hashtbl.mem t.values e then
Hashtbl.find t.values e
else
begin
let v = Array.length t.vertexes in
let nvertexes =
Array.init
(v + 1)
(fun i ->
if i = v then
e, ref SetInt.empty
else
t.vertexes.(i))
in
t.vertexes <- nvertexes;
Hashtbl.add t.values e v;
v
end
let add_edge t v1 v2 =
let size = Array.length t.vertexes in
if 0 <= v1 && v1 < size &&
0 <= v2 && v2 < size then
begin
let _, edges = t.vertexes.(v1) in
edges := SetInt.add v2 !edges
end
else
invalid_arg "add_edge"
let topological_sort t =
let size = Array.length t.vertexes in
(* Empty list that will contain the sorted vertexes *)
let l = ref [] in
(* Visited vertexes *)
let visited = Array.make size false in
let reverted_edges =
let arr = Array.make size [] in
for v1 = 0 to size - 1 do
SetInt.iter
(fun v2 -> arr.(v2) <- v1 :: arr.(v2))
!(snd t.vertexes.(v1))
done;
arr
in
let rec visit v =
if not visited.(v) then
begin
visited.(v) <- true;
List.iter visit reverted_edges.(v);
l := v :: !l
end
in
(* Go through all vertexes with no outgoing edges *)
for v = 0 to size - 1 do
visit v
done;
!l
let fold_edges f t acc =
let racc = ref acc in
for v1 = 0 to Array.length t.vertexes - 1 do
SetInt.iter
(fun v2 -> racc := f v1 v2 !racc)
!(snd t.vertexes.(v1))
done;
!racc
let transitive_closure t =
let size = Array.length t.vertexes in
let visited = Array.make size false in
let rec visit set v =
if not visited.(v) then
begin
(* The set of outgoing edges is not complete *)
let current_set = snd t.vertexes.(v) in
let set' =
SetInt.fold
(fun v set' -> visit set' v)
!current_set !current_set
in
visited.(v) <- true;
current_set := set';
SetInt.union set set'
end
else
begin
(* The set is complete *)
SetInt.union set !(snd t.vertexes.(v))
end
in
for v = 0 to size - 1 do
let _set : SetInt.t = visit SetInt.empty v in
()
done
|