The unpac monorepo manager self-hosting as a monorepo using unpac
nicer CHANGES
+8
-8
+8
-8
CHANGES.md
+8
-8
CHANGES.md
···
7
7
- fix incorrect uses of polymorphic equality (Steffen Smolka, Boris Yakobowski)
8
8
- [Coloring] fixed generation of OCamlDoc documentation
9
9
(contributed by Earnestly)
10
-
- * [Coloring] functions now fail if the graph is directed
11
-
- * [Coloring] now uses a single, global exception [NoColoring]
10
+
- :exclamation: [Coloring] functions now fail if the graph is directed
11
+
- :exclamation: [Coloring] now uses a single, global exception [NoColoring]
12
12
- [Coloring] new function two_color to 2-color a graph (or fail)
13
-
- * [Fixpoint] Take initial labeling of nodes into account (Johannes Kloos)
13
+
- :exclamation: [Fixpoint] Take initial labeling of nodes into account (Johannes Kloos)
14
14
15
15
# 1.8.8, October 17, 2017
16
16
17
17
- fixed installation (Virgile Prevosto, Jacques-Pascal Deplaix)
18
18
- safe-string compatible (Jacques-Pascal Deplaix)
19
-
- * fixed method get_edge_layout of class abstract_model of DGraphModel.Make. The
19
+
- :exclamation: fixed method get_edge_layout of class abstract_model of DGraphModel.Make. The
20
20
bug could have occured when there are several edges between two vertices.
21
21
- [Traverse/Pack] added Dfs.fold and Dfs.fold_component (tail-recursive)
22
22
(contributed by Guillaume Chelfi)
23
-
- * fixed implementation of Golberg-Tarjan maximal flow algorithm
23
+
- :exclamation: fixed implementation of Golberg-Tarjan maximal flow algorithm
24
24
(contributed by Guyslain Naves) No more function min_capacity in
25
25
the input interface. Renaming as follows: Flow.Goldberg ->
26
26
Flow.Goldberg_Tarjan and Pack.goldberg -> Pack.goldberg_tarjan
···
38
38
- fixed configuration on Windows (patch by Martin R. Neuhäußer)
39
39
- new functor [Components.Undirected] to compute connected components
40
40
- Graphviz: fixed printing of attribute BgcolorWithTransparency
41
-
- * Prim, Nonnegative: function weight now has the more general type "edge -> t"
41
+
- :exclamation: Prim, Nonnegative: function weight now has the more general type "edge -> t"
42
42
(to be consistent with Path)
43
43
- new module type Sig.WEIGHT (used in Path, Prim, and Nonnegative)
44
44
- Fixpoint: do not catch Not_found raised by a user-provided function.
···
46
46
47
47
# 1.8.6, January 23, 2015
48
48
49
-
- * Dominator: new functor [Make_graph] with may use graph building operations,
49
+
- :exclamation: Dominator: new functor [Make_graph] with may use graph building operations,
50
50
while the old functor [Make] now only requires a read-only graph.
51
51
Function [compute_all] and [compute_dom_graph] are now only defined in the
52
52
new [Make_graph] functor.
53
53
- Graphviz: support for additional polygonal-shapes
54
54
- New module Clique (contributed by Giselle Reis)
55
55
- Avoid ocamldoc error with OCaml 4.02
56
-
- * Path: function weight now has the more general type "edge -> t"
56
+
- :exclamation: Path: function weight now has the more general type "edge -> t"
57
57
(contributed by Steffen Smolka)
58
58
update your code by turning "weight l" into "weight (G.E.label e)"
59
59
- installation: "make install-findlib" now uses DESTDIR when defined