Rooster Graph - Summary

This group is not part of the GNU Project.

Rooster Graph is a free graph library for Scheme. Patterned after the popular <a href="http://www.boost.org/libs/graph/doc/table_of_contents.html">Boost Graph Library</a> 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 <a href="http://www.boost.org/libs/graph/doc/table_of_contents.html">Boost Graph Library</a>, 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 <a href="http://www.call-with-current-continuation.org">CHICKEN Scheme</a>, although porting it to other Scheme implementations would be quite easy.

<strong>Future directions</strong>:
<ul><li>Graph containers backed by databases.  The reference database            will be <a href="http://www.sleepycat.com/products/db.shtml">Berkeley DB</a>.</li>
   <li>Export to the <a href="http://www.gupro.de/GXL/">GXL</a> format.  This is one of the two standard graph formats (the other is <a href="http://graphml.graphdrawing.org/">GraphML</a>, which has not been widely adopted).</li>
   <li>More graph algorithms!</li>
</ul>

Registration Date: Sat 17 Jul 2004 09:42:21 PM UTC
License: Modified BSD License
Development Status: 4 - Beta