\brief Given start, return maximal range of overlapping Varnodes Advance the iterator until no Varnodes after the iterator intersect any Varnodes from the initial Varnode through the current iterator. The range is returned as pairs of iterators to subranges. One subrange for each set of Varnodes with the same size and starting address. A final iterator to the next Varnode after the overlapping s
source not stored for this graph (policy: none)