add ` from ' as a predecessor of ` this ' node . returns true iff the graph changed . private : breaks graph invariant ! concode_field_sep int INITIAL_HASHSET_CAPACITY concode_elem_sep int ARRAYLIST_THRESHOLD concode_elem_sep int hashCode concode_elem_sep T label concode_elem_sep Collection<Node<T>> succs concode_elem_sep Collection<Node<T>> preds concode_field_sep boolean add concode_elem_sep T getLabel concode_elem_sep boolean removeSuccessor concode_elem_sep Collection<Node<T>> getSuccessors concode_elem_sep int numSuccessors concode_elem_sep boolean addSuccessor concode_elem_sep void removeAllEdges concode_elem_sep boolean removePredecessor concode_elem_sep boolean remove concode_elem_sep int numPredecessors concode_elem_sep int hashCode concode_elem_sep boolean equals concode_elem_sep boolean hasPredecessors concode_elem_sep boolean hasSuccessors concode_elem_sep String toString concode_elem_sep Collection<Node<T>> getPredecessors concode_elem_sep boolean updateField
boolean function ( Node < T > arg0 ) { return add ( true , arg0 ) ; }