Ocamlgraph is a graph library for Ocaml written by Sylvain Conchon, Jean-Christophe Filliâtre, and Julien Signoles. I did a few improvements to the library for use with our SMT solver beaver. It is based on 0.99b version of the official ocamlgraph. I have renamed the package to ocamlgraph-modified, so as long as you use Findlib (i.e. ocamlfind) to install, there won't be a clash with your existing ocamlgraph installation.

Download the source: ocamlgraph-modified-0.99b-1.tar.gz

How to install

The modified version uses automake and OcamlMakefile in addition to autoconf. To build, do: configure; make install. This will install the library using ocamlfind as a package named ocamlgraph-modified.

List of changes

• Improvements to Gml: added Gml.Print2 for graphs in which vertices already have suitable integer ids. Gml.Print generates its own vertex ids by keeping a counter. Also added 'directed' attribute to the GML output.

• Added Path.Check2, which implements path check between two vertices for a marked DAG using BFS/DFS and vertex levels.

• Added MARK2 – an enhanced version of MARK. It allows multiple simultaneous marks for a vertex, and convenient management of used and unused mark values.

• Added Traverse.Dfs2: enhanced version of Traverse.Dfs for use with imperative graphs with marks.

• Added Traverse.Bfs2: similar to Dfs2, it is an enhanced version of Traverse.Bfs for use with imperative graphs with marks.

• Improved build infrastructure that uses not just autoconf, but automake and OCamlMakefile as well.