 |
FGL - A Functional Graph Library
|
The functional graph library provides a collection of graph operations
to be used in functional languages, such as ML or Haskell.
The library is based on the idea of inductive graphs.
An inductive view of graphs is given by the following description:
a graph is either empty, or it is extended by a new node together
with edges from its predecessors and to its successors. This
idea is explained the paper
Inductive Graphs and Functional Graph Algorithms.
The library is in an intermediate stage and is available
in two versions:
-
Standard ML (1997 Standard).
The focus is on providing a variety of modules containing
alternative implementations of functional graphs such that
for a specific application the most efficient implementation
can be chosen.
Go to FGL/ML.
- Haskell (1998 Standard). This is the second, but still preliminary
version. In particular, currently only the binary tree implementation of
functional graphs is provided (all the advanced implementations of the ML
version make use of imperatively updatable arrays).
Go to FGL/Haskell.
New version available!