+1 on that!

Graphs are common and many people are going to write similar
algorithms to yours. Also, as a library, it is going to have nice
interface (than if put together with Datalog) and will be much easier
to reuse.

Frantisek

PS: Graphs are my favorite data structure, so I am lobbying for
that :-)

On 22 Ún, 02:59, 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