List < T > function ( ) { List < T > loc0 = new ArrayList < > ( ) ; for ( DirectedAcyclicGraphNode < T > loc1 : mRoots ) { loc0 . add ( loc1 . getPayload ( ) ) ; } return loc0 ; }
gets the payloads of all the root nodes of the dag . concode_field_sep List<DirectedAcyclicGraphNode<T>> mRoots concode_elem_sep Map<T,DirectedAcyclicGraphNode<T>> mIndex concode_field_sep void add concode_elem_sep void deleteLeaf concode_elem_sep List<T> getParents concode_elem_sep List<T> sortTopologically concode_elem_sep List<T> getChildren concode_elem_sep boolean contains concode_elem_sep boolean isRoot concode_elem_sep List<T> getAllInTopologicalOrder