Rooster Graph is a graph library for Scheme. Patterned after the
popular Boost Graph Library for C++, it allows for a very clean
separation between the graph container and graph algorithms. It does
not have the complete functionality of the Boost Graph Library, but it
does go a bit further by having both strict- and lazy-evaluated
methods; the user of the graph has pause/continue/stop control and is
not constrained by memory.

Rooster Graph uses Scheme macros to get the benefit of speed while
having generic operations. It has only been implemented on CHICKEN
Scheme, although porting it to other Scheme implementations would be
quite easy.

It was developed on Cygwin, and the reference Scheme implementation is
CHICKEN Scheme.

Where to get it:

   http://njbeckford.home.comcast.net/

Future directions:

   Graph containers backed by databases.  The reference database
   will be Berkeley DB.  http://www.sleepycat.com/products/db.shtml

   Export to the GXL format.  http://www.gupro.de/GXL/.  This is one
   of the two standard graph formats (the other is GraphML, which has
   not been widely adopted).

   More graph algorithms!
