Examples of org.neo4j.graphdb.traversal.TraversalDescription.traverse()

Class org.neo4j.graphdb.traversal.TraversalDescription

Examples of org.neo4j.graphdb.traversal.TraversalDescription.traverse()

org.neo4j.graphdb.traversal.TraversalDescription.traverse()
Traverse from {@code startNode} based on all the rules and behaviorin this description. A {@link Traverser} is returned which isused to step through the graph and getting results back. The traversal is not guaranteed to start before the Traverser is used. @param startNode the {@link Node} to start the traversal from. @return a {@link Traverser} used to step through the graph and to getresults from.

                                .relationships(withName("R3"), INCOMING)
                                .depthFirst()
                                .uniqueness(Uniqueness.NODE_GLOBAL)
                                .evaluator(Evaluators.toDepth(3));


                        assertEquals(4, count(traversalDescription.traverse(deletedRel.getStartNode()).nodes()));
                    }
                }
        );
    }

View Full Code Here

                                .relationships(withName("R3"), INCOMING)
                                .depthFirst()
                                .uniqueness(Uniqueness.NODE_GLOBAL)
                                .evaluator(Evaluators.toDepth(3));


                        assertEquals(4, count(traversalDescription.traverse(previous).nodes()));
                    }
                }
        );
    }

View Full Code Here

                                .relationships(withName("R2"), OUTGOING)
                                .relationships(withName("R3"), INCOMING)
                                .depthFirst()
                                .uniqueness(Uniqueness.NODE_GLOBAL);


                        assertEquals(3, count(traversalDescription.traverse(current).nodes()));


                    }
                }
        );
    }

View Full Code Here

                                .relationships(withName("R3"), INCOMING)
                                .depthFirst()
                                .uniqueness(Uniqueness.NODE_GLOBAL)
                                .evaluator(Evaluators.toDepth(3));


                        assertEquals(4, count(traversalDescription.traverse(one).nodes()));
                    }
                }
        );
    }

View Full Code Here

                                .relationships(R2, OUTGOING)
                                .depthFirst()
                                .uniqueness(Uniqueness.NODE_GLOBAL)
                                .evaluator(Evaluators.toDepth(3));


                        assertEquals(4, count(traversalDescription.traverse(deletedRel.getStartNode()).nodes()));
                    }
                }
        );
    }

View Full Code Here

                                .relationships(R2, OUTGOING)
                                .depthFirst()
                                .uniqueness(Uniqueness.NODE_GLOBAL)
                                .evaluator(Evaluators.toDepth(3));


                        assertEquals(4, count(traversalDescription.traverse(previous).nodes()));
                    }
                }
        );
    }

View Full Code Here

                                .relationships(R1, OUTGOING)
                                .relationships(R2, OUTGOING)
                                .depthFirst()
                                .uniqueness(Uniqueness.NODE_GLOBAL);


                        assertEquals(3, count(traversalDescription.traverse(current).nodes()));


                    }
                }
        );
    }

View Full Code Here

                                .relationships(R2, OUTGOING)
                                .depthFirst()
                                .uniqueness(Uniqueness.NODE_GLOBAL)
                                .evaluator(Evaluators.toDepth(3));


                        assertEquals(4, count(traversalDescription.traverse(one).nodes()));
                    }
                }
        );
    }

View Full Code Here

                                .relationships(R2, OUTGOING)
                                .depthFirst()
                                .uniqueness(Uniqueness.NODE_GLOBAL)
                                .evaluator(Evaluators.toDepth(3));


                        assertEquals(4, count(traversalDescription.traverse(previous.getEndNode()).nodes()));
                    }
                }
        );
    }

View Full Code Here

                                .relationships(R1, OUTGOING)
                                .relationships(R2, OUTGOING)
                                .depthFirst()
                                .uniqueness(Uniqueness.NODE_GLOBAL);


                        assertEquals(3, count(traversalDescription.traverse(current.getEndNode()).nodes()));
                    }
                }
        );
    }

View Full Code Here

0 1 2

TOP

All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.