//JAVA TO C# CONVERTER TODO TASK: Most Java annotations will not have direct .NET equivalent attributes:
//ORIGINAL LINE: @Test public void traverseThroughNodeWithLoop()
public virtual void TraverseThroughNodeWithLoop()
{
/*
* (a)-->(b)-->(c)-->(d)-->(e)
* / \ / \
* \__/ \__/
*/
CreateGraph("a TO b", "b TO c", "c TO c", "c TO d", "d TO d", "d TO e");
using (Transaction tx = BeginTx())
{
Node a = GetNodeWithName("a");
//JAVA TO C# CONVERTER WARNING: The original Java variable was marked 'final':
//ORIGINAL LINE: final org.neo4j.graphdb.Node e = getNodeWithName("e");
Node e = GetNodeWithName("e");
Evaluator onlyEndNode = path => Evaluation.ofIncludes(path.endNode().Equals(e));
TraversalDescription basicTraverser = GraphDb.traversalDescription().evaluator(onlyEndNode);
ExpectPaths(basicTraverser.Traverse(a), "a,b,c,d,e");
ExpectPaths(basicTraverser.Uniqueness(Uniqueness.RELATIONSHIP_PATH).traverse(a), "a,b,c,d,e", "a,b,c,c,d,e", "a,b,c,d,d,e", "a,b,c,c,d,d,e");
tx.Success();
}
}
public ShortestPathsBranchCollisionDetector(Evaluator evaluator, System.Predicate <Path> pathPredicate) : base(evaluator, pathPredicate)
{
}
public DijkstraBranchCollisionDetector(Evaluator evaluator, CostEvaluator costEvaluator, MutableDouble shortestSoFar, double epsilon, System.Predicate <Path> pathPredicate) : base(evaluator, pathPredicate)
{
this._costEvaluator = costEvaluator;
this._shortestSoFar = shortestSoFar;
this._epsilon = epsilon;
}
