Intervals returns the intervals contained within the given graph, based on the entry node.

An Interval I(h) is the maximal, single-entry subgraph in which h is the only entry node and in which all closed paths contain h.