Hi,
I have some very basic work on graphs for Slate, though none of the
interesting algorithms have been done. Arrow's Graphs are just the
relational kind of graphs. And I *really* need to update that code. This
is what happens when your research projects are hobbies. :P

Anyway, I am also interested in the subject. One thing you might
distinguish is the manner of the implementation, in other words, what
objects are used, whether the "contents" of the graph have to be the nodes
themselves, how neighborhood is annotated, etc. These things actually
determine the behavioral type of the graph. I'm discovering this, since
I'm trying to write interchangeable implementations for common collection
concepts.

Anyway, I would like to contribute if it's necessary. I don't know when
I'll have the need for great graph support in Slate, and need is driving
the implementation direction at the moment.

Good luck!

On Wed, 4 Dec 2002, Samir Saidani wrote:

> Hi
>
> I'm planning building a Collection-Graph, for my
> research (phD). I would like to know if there is such a functional
> Graph classes ?
>
> I know several implementations :
>
> - Arrow implements a Graph, with a new and original manner,  I
> have to see if it's possible to encapsulate the common abstraction of graphs
> (I mean nodes, edges...).
>
> Do you know others implementations ?
>
> Thanks at all !
>
>

-- 
Brian T. Rice
LOGOS Research and Development
mailto:water at tunes.org
http://tunes.org/~water/