Well, right now I'm just handling directed graphs, and basically treating nodes as integer indexes, with a simple formula from index to adjacency list of nodes.
I'm not opposed to a more elaborate implementation. Patch welcome :) On Mon, Feb 23, 2009 at 7:33 PM, Jeff Rose <ros...@gmail.com> wrote: > > Jeffrey Straszheim 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? > > That would be great. Especially if the algorithms can operate over some > kind of generalized interface, so the algorithms can run over different > graph implementations. I'm writing a semi-structured storage library on > top of the neo4j graph database, and it would be great if I could > analyze properties like connectedness, degree distribution, etc. I'm > writing a graph query engine too, so it would also be cool if it could > run over the in-memory graphs from your library. > > -Jeff > > > > --~--~---------~--~----~------------~-------~--~----~ 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 -~----------~----~----~----~------~----~------~--~---
