The unpac monorepo manager self-hosting as a monorepo using unpac
doc: mirror image of DAG is called converse/transpose/reverse graph
It's easier to look for this function if the synonyms are present.
The Wikipedia page refers to the converse / transpose / reverse
terminology.
"mirror image" or "mirror image graph", although quite descriptive,
doesn't always match the existing literature or terminology.
+10
-7
+3
-2
src/components.mli
+3
-2
src/components.mli
···
69
69
A strong articulation point is a vertex that when removed from the
70
70
original graph disconnects that graph into two or more components.
71
71
72
-
The implementation involves constructing the mirror image of the
73
-
graph; for bidirectional graphs prefer {!module:BiConnectivity}.
72
+
The implementation involves constructing the mirror image (also
73
+
called converse, transpose, or reverse) of the graph; for
74
+
bidirectional graphs prefer {!module:BiConnectivity}.
74
75
75
76
Implements the algorithm from Italiano, Laura, and Santaroni,
76
77
TCS 447 (2012), "Finding strong bridges and strong articulation points
+3
-2
src/oper.mli
+3
-2
src/oper.mli
···
49
49
(then acts as [transitive_reduction]). *)
50
50
51
51
val mirror : g -> g
52
-
(** [mirror g] returns a new graph which is the mirror image of [g]:
53
-
each edge from [u] to [v] has been replaced by an edge from [v] to [u].
52
+
(** [mirror g] returns a new graph which is the mirror image (also
53
+
called converse, transpose, or reverse) of [g]: each edge from
54
+
[u] to [v] has been replaced by an edge from [v] to [u].
54
55
For undirected graphs, it simply returns [g].
55
56
Note: Vertices are shared between [g] and [mirror g]; you may need to
56
57
make a copy of [g] before using [mirror] *)
+4
-3
src/sig_pack.mli
+4
-3
src/sig_pack.mli
···
247
247
(then acts as [transitive_reduction]). *)
248
248
249
249
val mirror : t -> t
250
-
(** [mirror g] returns a new graph which is the mirror image of [g]:
251
-
each edge from [u] to [v] has been replaced by an edge from [v] to [u].
252
-
For undirected graphs, it simply returns a copy of [g]. *)
250
+
(** [mirror g] returns a new graph which is the mirror image (also called
251
+
converse, transpose, or reverse) of [g]: each edge from [u] to [v] has
252
+
been replaced by an edge from [v] to [u]. For undirected graphs, it
253
+
simply returns a copy of [g]. *)
253
254
254
255
val complement : t -> t
255
256
(** [complement g] builds a new graph which is the complement of [g]: