public List < T > getChildren ( T payload ) { List < T > children = new ArrayList <> ( ) ; if ( ! mIndex . containsKey ( payload ) ) { return children ; } DirectedAcyclicGraphNode < T > node = mIndex . get ( payload ) ; for ( DirectedAcyclicGraphNode < T > child : node . getChildren ( ) ) { children . add ( child . getPayload ( ) ) ; } return children ; }
Gets the payloads for the children of the given node .