public AbstractNode getChild ( Interval < T > interval ) throws MIDDException { for ( AbstractEdge < T > e : this . edges ) { if ( e . containsInterval ( interval ) ) { return e . getSubDiagram ( ) ; } } return null ; }
Return the child of the current node with equivalent interval on its incoming edge .