//JAVA TO C# CONVERTER TODO TASK: Most Java annotations will not have direct .NET equivalent attributes:
//ORIGINAL LINE: @Test public void pathsForOneDirection()
public virtual void PathsForOneDirection()
{
/*
* (a)-->(b)==>(c)-->(d)
* ^ /
* \--(f)<--(e)<-/
*/
CreateGraph("a TO b", "b TO c", "c TO d", "d TO e", "e TO f", "f TO a");
PathExpander <Void> expander = PathExpanders.forTypeAndDirection(To, OUTGOING);
ExpectPaths(GraphDb.bidirectionalTraversalDescription().mirroredSides(GraphDb.traversalDescription().uniqueness(NODE_PATH).expand(expander)).traverse(GetNodeWithName("a"), GetNodeWithName("f")), "a,b,c,d,e,f");
ExpectPaths(GraphDb.bidirectionalTraversalDescription().mirroredSides(GraphDb.traversalDescription().uniqueness(RELATIONSHIP_PATH).expand(expander)).traverse(GetNodeWithName("a"), GetNodeWithName("f")), "a,b,c,d,e,f", "a,b,c,d,e,f");
}
//JAVA TO C# CONVERTER TODO TASK: Most Java annotations will not have direct .NET equivalent attributes:
//ORIGINAL LINE: @Test public void collisionEvaluator()
public virtual void CollisionEvaluator()
{
/*
* (d)-->(e)--
* ^ | \
* | v v
* (a)-->(b)<--(f)
* | ^
* v /
* (c)-/
*/
CreateGraph("a TO b", "a TO c", "c TO b", "a TO d", "d TO e", "e TO b", "e TO f", "f TO b");
PathExpander <Void> expander = PathExpanders.forTypeAndDirection(To, OUTGOING);
BidirectionalTraversalDescription traversal = GraphDb.bidirectionalTraversalDescription().mirroredSides(GraphDb.traversalDescription().uniqueness(NODE_PATH).expand(expander));
ExpectPaths(traversal.CollisionEvaluator(includeIfContainsAll(GetNodeWithName("e"))).traverse(GetNodeWithName("a"), GetNodeWithName("b")), "a,d,e,b", "a,d,e,f,b");
ExpectPaths(traversal.CollisionEvaluator(includeIfContainsAll(GetNodeWithName("e"), GetNodeWithName("f"))).traverse(GetNodeWithName("a"), GetNodeWithName("b")), "a,d,e,f,b");
}
//JAVA TO C# CONVERTER TODO TASK: Most Java annotations will not have direct .NET equivalent attributes:
//ORIGINAL LINE: @Test public void mirroredTraversalReversesInitialState()
public virtual void MirroredTraversalReversesInitialState()
{
/*
* (a)-->(b)-->(c)-->(d)
*/
CreateGraph("a TO b", "b TO c", "c TO d");
BranchCollisionPolicy collisionPolicy = (evaluator, pathPredicate) => new StandardBranchCollisionDetectorAnonymousInnerClass(this);
Iterables.count(GraphDb.bidirectionalTraversalDescription().mirroredSides(GraphDb.traversalDescription().uniqueness(NODE_PATH).expand(PathExpanders.forType(To), new Org.Neo4j.Graphdb.traversal.InitialBranchState_State <>(0, 10))).collisionPolicy(collisionPolicy).traverse(GetNodeWithName("a"), GetNodeWithName("d")));
}
