public void testPathExpressionNextMatchRecursive(){
  GraphModel graph=new GraphModel();
  GraphNode[] nodes=fillGraphModel(graph);
  PathExpression pathExpression=createPathExpression(true,false,true);
  Collection<GraphNode> output=pathExpression.nextMatch(graph,buildSingleSet(nodes[0]));
  assertEquals(2,output.size());
  assertGraphContainsElement(output,nodes,4);
  assertGraphContainsElement(output,nodes,6);
}

public void testPathExpressionNextMatchRecursive ( ) { GraphModel graph = new GraphModel ( ) ; GraphNode [ ] nodes = fillGraphModel ( graph ) ; PathExpression pathExpression = createPathExpression ( true , false , true ) ; Collection < GraphNode > output = pathExpression . nextMatch ( graph , buildSingleSet ( nodes [ 0 ] ) ) ; assertEquals ( 2 , output . size ( ) ) ; assertGraphContainsElement ( output , nodes , 4 ) ; assertGraphContainsElement ( output , nodes , 6 ) ; }
tests recursive version of pathexpression . nextmatch ( graphmodel , collection < graphnode > )
