2.1.0

CHANGES:

• ❗ OCamlGraph now requires OCaml >= 4.08
• ❗ [Traverse]: fixed [Dfs.fold] and [Dfs.fold_component],
  which were not implementing a proper DFS
• [Classic]: new functions [cycle] and [grid]
• [Eulerian]: Eulerian paths (new module)
• [Components]: strong articulation points (see functors [Connectivity]
  and [BiConnectivity]) (Timothy Bourke)
• [Dominator]: non-trivial dominators (Timothy Bourke)
• #31: fixed documentation of [map_vertex]: the supplied function
  must be injective
• #110: ensure that map_vertex applies the function only once per vertex

2.0.0

CHANGES:

• port to dune and opam 2.0
  • ❗ opam package now split into two packages: ocamlgraph and ocamlgraph_gtk
  • [WeakTopological] fixed incorrect use of generic hash tables
    (#99, Tomáš Dacík)
  • [Oper] fixed transitive_reduction (#91)
  • fix incorrect uses of polymorphic equality (Steffen Smolka, Boris Yakobowski)
  • [Coloring] fixed generation of OCamlDoc documentation
    (contributed by Earnestly)
  • ❗ [Coloring] functions now fail if the graph is directed
  • ❗ [Coloring] now uses a single, global exception [NoColoring]
  • [Coloring] new function two_color to 2-color a graph (or fail)
  • ❗ [Fixpoint] Take initial labeling of nodes into account (Johannes Kloos)

release 1.8.8

v1.8.8

1.8.7

1.8.7

v186

v186

v1.8.5

v1.8.5

v1.8.3

v1.8.3

v1.8.2

v1.8.2

v1.8.1

v1.8.1