On Feb 24, 1:33 am, Jeff Rose <ros...@gmail.com> wrote: > > 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.
Neo4j has a component for doing those kinds of computations: http://components.neo4j.org/graph-algo/ It's still in alpha stage, but the Neo team is working on improving it, and one day make a production ready tool from it. With your input that process would be greatly aided. You don't have to contribute code, comments from users are very valuable as well. /Tobias --~--~---------~--~----~------------~-------~--~----~ 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 -~----------~----~----~----~------~----~------~--~---
