
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:
last change: September 18, 2002  Martin Erwig erwig@eecs.oregonstate.edu 