Yep makes sense. You can get the highest node id by asking the NodeManager afaik.
((GraphDatabaseAPI)gdb).getDepencencyResolver().resolveDependency(NodeManager.class).getHighestIdInUse(Node.class) Written out of the top of my head, so please check that this works :) On Tue, Apr 22, 2014 at 8:02 AM, Lokesh Gidra <[email protected]>wrote: > Hello, > > I am trying to write a java program which will use neo4j in embedded mode. > This program will use fork/join mechanism to traverse the graph in parallel > to perform operations like finding connected components. Can someone please > suggest me the best way to divide the task in this scenario? The only idea > that struck my mind is to use the node ids and dividing the range. > > > Regards, > Lokesh > > -- > You received this message because you are subscribed to the Google Groups > "Neo4j" group. > To unsubscribe from this group and stop receiving emails from it, send an > email to [email protected]. > For more options, visit https://groups.google.com/d/optout. > -- You received this message because you are subscribed to the Google Groups "Neo4j" group. To unsubscribe from this group and stop receiving emails from it, send an email to [email protected]. For more options, visit https://groups.google.com/d/optout.
