Iterator < Node > function ( Graph arg0 , Node arg1 , Path arg2 ) { return eval$ ( arg0 , arg1 , arg2 , new PathEngineN ( arg0 , true ) ) ; }
evaluate a path : counting semantics concode_field_sep PlaceHolder placeHolder concode_field_sep Iterator<Node> evalReverseN concode_elem_sep Iterator<Node> evalReverse1 concode_elem_sep Iterator<Node> eval concode_elem_sep Iterator<Node> eval1 concode_elem_sep Iterator<Node> evalReverse concode_elem_sep void eval$ concode_elem_sep Iter<Node> eval$