boolean function ( ) { return directed ; }
determine whether the dagpath is directed . directed paths will have a sequence of steps that respect edge ordering , and the source will be strictly before the target in the graph . concode_field_sep PLUSObject head concode_elem_sep boolean directed concode_elem_sep PLUSObject tail concode_elem_sep LineageDAG sourceDAG concode_elem_sep List<PathStep> steps concode_field_sep PLUSObject getTail concode_elem_sep void addStep concode_elem_sep PathStep getLastStep concode_elem_sep PathStep getStep concode_elem_sep boolean pathExists concode_elem_sep boolean contains concode_elem_sep boolean contains concode_elem_sep boolean contains concode_elem_sep PLUSObject getHead concode_elem_sep boolean equals concode_elem_sep DAGPath clone concode_elem_sep List<PathStep> getSteps concode_elem_sep boolean exists concode_elem_sep int getLength concode_elem_sep String toString concode_elem_sep List<PathStep> findPath