Patrik,
this is a great effort and very nice docs indeed! Thanks for your work
on this, I guess a number of users and projects appreciate this when
using Neo4j in real world scenarios.

/peter

GTalk: neubauer.peter
Skype peter.neubauer
ICQ 18762544
Phone +46704 106975
LinkedIn http://www.linkedin.com/in/neubauer
Twitter http://twitter.com/peterneubauer

http://www.neo4j.org - New Energy for Data - the Graph Database.
http://www.ops4j.org - New Energy for OSS Communities - Open
Participation Software.
http://www.qi4j.org - New Energy for Java - Domain Driven Development.




On Mon, Sep 22, 2008 at 10:01 AM, Patrik Larsson
<[EMAIL PROTECTED]> wrote:
> Hi all!
>
> As some of you know, I've been working on a component for Neo4j
> implementing some graph algorithms, focusing on finding shortest paths
> and some centrality measures.
>
> This component has finally been released. You should be able to
> include it into your maven projects by simply adding to your pom.xml:
>
> <dependency>
>   <groupId>org.neo4j</groupId>
>   <artifactId>graph-algo</artifactId>
>   <version>0.1-SNAPSHOT</version>
> </dependency>
>
> Some links of interest follows.
> Wiki:
> http://wiki.neo4j.org/content/Graph-algo_Guide
>
> Code repository:
> https://svn.neo4j.org/components/graph-algo/
>
> Component page:
> http://components.neo4j.org/graph-algo/
>
> Java-doc:
> http://components.neo4j.org/graph-algo/apidocs/index.html
>
> Take care.
> /Patrik
> _______________________________________________
> Neo mailing list
> User@lists.neo4j.org
> https://lists.neo4j.org/mailman/listinfo/user
>
>
_______________________________________________
Neo mailing list
User@lists.neo4j.org
https://lists.neo4j.org/mailman/listinfo/user

Reply via email to