The unpac monorepo manager self-hosting as a monorepo using unpac
updated FAQ (issue #73)
+16
+16
FAQ
+16
FAQ
···
2
2
FREQUENTLY ASKED QUESTIONS
3
3
==========================
4
4
5
+
6
+
==========
7
+
Q: Is it possible to update imperative graph during traversal
8
+
done by |fold_vertex| or |iter_vertex|?
9
+
A: Imperative graphs being implemented with hash tables, the answer is no.
10
+
11
+
Workarounds include
12
+
- storing update information on the side, then apply it in a second step;
13
+
- mutate a second graph instead.
14
+
15
+
Regarding the latter, it is worth pointing out OCamlgraph also
16
+
provides immutable graphs that could make it more efficient (free
17
+
``copy'' and possible sharing between the two graphs, at the extra
18
+
cost of logarithmic operations instead of constant-time
19
+
operations).
20
+
==========
5
21
==========
6
22
Q: I need to store some information into vertices and/or edges
7
23
I need several kind of labels on the edges