@Test public void testCIsReturnedOnDepthTwoBreadthFirst() { testCIsReturnedOnDepthTwo( getGraphDb().traversalDescription().breadthFirst() ); }
@Test public void testRelationshipsAreReturnedOnceWhenSufficientRecentlyUniqueBreadthFirst() { testRelationshipsAreReturnedOnceWhenSufficientRecentlyUnique( getGraphDb().traversalDescription().breadthFirst() ); }
@Test public void testAllUniqueRelationshipPathsAreReturnedBreadthFirst() { testAllUniqueRelationshipPathsAreReturned( getGraphDb().traversalDescription().breadthFirst() ); }
@Test public void testNodeGlobalTraversalCanFinishBreadthFirst() { execute( getGraphDb().traversalDescription().breadthFirst(), Uniqueness.NODE_GLOBAL ); }
@Test public void testNodeRecentTraversalCanFinishBreadthFirst() { execute( getGraphDb().traversalDescription().breadthFirst(), Uniqueness.NODE_RECENT ); }
@Test public void shouldGetBothNodesOnDepthOneForBreadthFirst() { shouldGetBothNodesOnDepthOne( getGraphDb().traversalDescription().breadthFirst() ); } }
@Test public void testRelationshipGlobalTraversalCanFinishBreadthFirst() { execute( getGraphDb().traversalDescription().breadthFirst(), Uniqueness.RELATIONSHIP_GLOBAL ); }
@Test public void testNodePathTraversalCanFinishBreadthFirst() { execute( getGraphDb().traversalDescription().breadthFirst(), Uniqueness.NODE_PATH ); }
@Test public void testRelationshipRecentTraversalCanFinishBreadthFirst() { execute( getGraphDb().traversalDescription().breadthFirst(), Uniqueness.RELATIONSHIP_RECENT ); }
@Test public void testAllRelationshipsAreReturnedOnceBreadthFirst() { testAllRelationshipsAreReturnedOnce( getGraphDb().traversalDescription().breadthFirst() ); }
@Test public void testNodesAreReturnedOnceWhenSufficientRecentlyUniqueBreadthFirst() { testNodesAreReturnedOnceWhenSufficientRecentlyUnique( getGraphDb().traversalDescription().breadthFirst() ); }
@Test public void canPruneTraversalAtSpecificDepthBreadthFirst() { canPruneTraversalAtSpecificDepth( getGraphDb().traversalDescription().breadthFirst() ); }
@Test public void canPreFilterNodesBreadthFirst() { canPreFilterNodes( getGraphDb().traversalDescription().breadthFirst() ); }
@Test public void testUnrestrictedTraversalCanFinishBreadthFirst() { execute( getGraphDb().traversalDescription().breadthFirst(), Uniqueness.NONE ); }
@Test public void testRelationshipPathTraversalCanFinishBreadthFirst() { execute( getGraphDb().traversalDescription().breadthFirst(), Uniqueness.RELATIONSHIP_PATH ); }
@Override protected Traverser instantiateTraverser( Node start, Node end ) { GraphDatabaseService db = start.getGraphDatabase(); TraversalDescription sideBase = db.traversalDescription().breadthFirst().uniqueness( NODE_PATH ); return db.bidirectionalTraversalDescription().mirroredSides( sideBase.expand( expander ) ) .sideSelector( LEVEL_STOP_DESCENT_ON_RESULT, maxDepth ) .collisionEvaluator( toDepth( maxDepth ) ) .traverse( start, end ); }
@Test public void shouldGetStartNodeWhenAtIsZeroBreadthFirst() { TraversalDescription description = getGraphDb().traversalDescription().breadthFirst() .evaluator(Evaluators.atDepth(0)); expectNodes( description.traverse( getNodeWithName( "2" ) ), "2" ); }
@Test public void shouldGetSecondNodeWhenAtIsTwoBreadthFirst() { TraversalDescription description = getGraphDb().traversalDescription().breadthFirst() .evaluator( Evaluators.atDepth( 2 ) ); expectNodes( description.traverse( getNodeWithName( "6" ) ), "4" ); } }
@Test public void shouldGetStartNodeWhenFromToIsZeroBreadthFirst() { TraversalDescription description = getGraphDb().traversalDescription().breadthFirst() .evaluator(Evaluators.fromDepth(0)).evaluator(Evaluators.toDepth(0)); expectNodes( description.traverse( getNodeWithName( "0" ) ), "0" ); }
@Test public void shouldGetSecondNodeWhenFromToIsTwoBreadthFirst() { TraversalDescription description = getGraphDb().traversalDescription().breadthFirst() .evaluator(Evaluators.fromDepth(2)).evaluator(Evaluators.toDepth(2)); expectNodes( description.traverse( getNodeWithName( "5" ) ), "2" ); }