FGL - A Functional Graph Library, Version: September 2002 ========================================================= I am happy to announce a new release of the Functional Graph Library for Haskell, a collection of graph algorithms and tools. New in this release: * Introduction of graph classes * Monadic graphs and graph computation monad * Graph implementation based on balanced (AVL) trees * Fast graph implementation based on IO arrays * New algorithms: - Maximum flow - Articulation points - Biconnected components - Dominators - Transitive closure * minor changes in utility functions Download: http://cs.oregonstate.edu/~erwig/fgl/haskell/ Please email comments, bugs, etc. to erwig@cs.orst.edu -- Martin