[Neo] Graph analysis algorithms-Gremlin

Amir Hossein Jadidinejad amir.jadidi at yahoo.com
Tue Apr 13 10:36:14 CEST 2010

I've created a small version of the web graph. I'm going to apply different graph algorithms (components, paths, distances,...) to know this graph better and better for future investigations. It seems that I have two options:
1. Using the graph algorithm package: http://components.neo4j.org/neo4j-graph-algo/
2. Using the Gremlin and leverage the algorithms of different graph libraries: http://wiki.github.com/tinkerpop/gremlin/working-with-jung-algorithms -

I don't have complete information about the last option. Would you please familiar us with it?
Let me know if there are any other option (or library other than JUNG) for this purpose.
Kind regards,


More information about the User mailing list