As a compiler writer I do a lot of graph-work, but nearly all of it
has cycles.
There was a thread earlier about defining cyclic graphs in Clojure.
Can someone point me to it?

Thanks,
Cliff


On Feb 22, 7:55 am, Rich Hickey <richhic...@gmail.com> wrote:
> On Feb 22, 2009, at 10:11 AM, Jeffrey Straszheim wrote:
>
> > Just as a point of fact, I don't plan to make a complete *every  
> > algorithm you can think of* package, just the ones I need.  However,  
> > it would be easy to add others submitted by the community.  I could  
> > be a gathering place of graph algorithms.
>
> Sounds good to me - thanks!
>
> Rich
>
> > On Sun, Feb 22, 2009 at 7:31 AM, Francesco Bellomi 
> > <francesco.bell...@gmail.com
> > > wrote:
>
> > +1
>
> > Francesco
>
> > On Feb 22, 2:59 am, Jeffrey Straszheim <straszheimjeff...@gmail.com>
> > wrote:
> > > As part of my Datalog work I'm putting together some directed graph
> > > algorithms, mostly things like finding strongly connected  
> > components, and
> > > building dependency stratifications (think topological sort but  
> > with the
> > > results groups in tiers of non-interdependent nodes).  Anyhow, I'm  
> > thinking
> > > this stuff will be usefull outside of Datalog, and am wondering if  
> > I should
> > > just add it to contrib as a stand-alone library?
--~--~---------~--~----~------------~-------~--~----~
You received this message because you are subscribed to the Google Groups 
"Clojure" group.
To post to this group, send email to clojure@googlegroups.com
To unsubscribe from this group, send email to 
clojure+unsubscr...@googlegroups.com
For more options, visit this group at 
http://groups.google.com/group/clojure?hl=en
-~----------~----~----~----~------~----~------~--~---

Reply via email to