Try to use Evaluators.toDepth(3)
On Sun, Apr 27, 2014 at 4:58 PM, ceren abay <[email protected]> wrote: > I want to find all paths between two nodes. I used these code: > > TraversalDescription desc = Traversal.description(); > desc.uniqueness(Uniqueness.RELATIONSHIP_GLOBAL); > > desc.evaluator(Evaluators.returnWhereEndNodeIs(graphDb.getNodeById(12))); > desc.evaluator(Evaluators.includingDepths(3, 3)); > > desc.relationships(RelTypes.husband_of).relationships(RelTypes.wife_of).relationships(RelTypes.brother_of).relationships(RelTypes.elti_of) > ; > Traverser traverse = desc.traverse(graphDb.getNodeById(4), > graphDb.getNodeById(12)); > > But it does not return the correct paths. It returns paths that has more > than 3 depth. > > -- > 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.
