List < N > function ( Graph arg0 , Class < N > arg1 ) { List < N > loc0 = new LinkedList < N > ( ) ; for ( Node loc1 : arg0 . getNodes ( ) ) { if ( arg1 . isInstance ( loc1 ) ) { if ( ! loc0 . contains ( loc1 ) ) { loc0 . add ( ( N ) loc1 ) ; } } } return loc0 ; }
returns a list of nodes of specific subclass of node from a specified graph . concode_field_sep PlaceHolder placeHolder concode_field_sep List<Node> getNextNodes concode_elem_sep Collection<Port> getPorts concode_elem_sep List<P> getPorts concode_elem_sep String isSameLabeledInput concode_elem_sep String getEncodedInputLabels concode_elem_sep List<Node> getJoinRequiredNodes concode_elem_sep LinkedList<StreamSourceNode> getStreamSourceNodes concode_elem_sep List<InputNode> getInputNodes concode_elem_sep Collection<WSNode> getWSNodes concode_elem_sep boolean isAllInputsLabeled concode_elem_sep boolean isRegulerNode concode_elem_sep void validateConnection concode_elem_sep List<T> sortByName concode_elem_sep String getSubWorkflowName concode_elem_sep boolean isInputOutputNode concode_elem_sep void propagateTypes concode_elem_sep List<OutputNode> getOutputNodes concode_elem_sep List<Node> getOutputNodes concode_elem_sep HashMap<String,LinkedList<Node>> partitionGraphOnLabel concode_elem_sep boolean visit concode_elem_sep boolean containsCycle concode_elem_sep boolean isAllInputsConnected