FGL/Haskell - A Functional Graph Library for Haskell
Version, November 2008

Kown bug:

New since the last version (June 2008):

(see also the file CHANGES)

The functional graph library for Haskell provides several modules that define inductive graphs and graph algorithms. An older version for ML can be found here.

To use the library:

You can find more information in the (very old) User Guide [ps.gz] [pdf]. Note: The User Guide refers to the March 2001 version of the FGL; it has not been updated to reflect the extensions and changes of the current version.

The previous versions of the FGL can be accessed here: June 2008 version, May 2008 version, April 2007 version, June 2006 version, February 2005 version, January 2004 version, September 2002 version.

The library contains not just a couple of graph algorithms, but rather builds upon a functional view of graphs and graph algorithms. This view is motivated and explained in the paper Inductive Graphs and Functional Graph Algorithms.

Please send questions, comments, and bug reports to Martin Erwig.

last change: December 26, 2009 Martin Erwig  erwig@eecs.oregonstate.edu