internal calculate method that will run the calculation until either the limit is reached or a result has been generated for a given node . concode_field_sep Direction relationShipDirection concode_elem_sep HashMap<Node,Integer> distances concode_elem_sep Node startNode concode_elem_sep LinkedList<Node> currentLayer concode_elem_sep long maxDepth concode_elem_sep HashMap<Node,List<Relationship>> predecessors concode_elem_sep RelationshipType[] relationShipTypes concode_elem_sep LinkedList<Node> nextLayer concode_elem_sep long depth concode_field_sep List<Node> getPathAsNodes concode_elem_sep Direction getDirection concode_elem_sep List<List<PropertyContainer>> getPaths concode_elem_sep List<Node> getPredecessorNodes concode_elem_sep void limitDepth concode_elem_sep List<Relationship> getPathAsRelationships concode_elem_sep void setStartNode concode_elem_sep List<PropertyContainer> getPath concode_elem_sep List<List<Node>> getPathsAsNodes concode_elem_sep void reset concode_elem_sep RelationshipType[] getRelationshipTypes concode_elem_sep Map<Node,List<Relationship>> getPredecessors concode_elem_sep Integer getCost concode_elem_sep List<List<Relationship>> getPathsAsRelationships concode_elem_sep boolean processNextNode
boolean function ( Node arg0 ) { while ( depth <= maxDepth && ( arg0 == null || ! distances . containsKey ( arg0 ) ) ) { if ( ! processNextNode ( ) ) { return false ; } } return true ; }