Previously, the subobjects in order of decreasing size were computed as an iterator, but the partial overlaps between ACSets was computed all at once. However, for things like maximum common subacset, we are not interested in enumerating all possible overlaps, so this PR modifies the partial overlap computation to be an iterator.
Previously, the subobjects in order of decreasing size were computed as an iterator, but the partial overlaps between ACSets was computed all at once. However, for things like maximum common subacset, we are not interested in enumerating all possible overlaps, so this PR modifies the partial overlap computation to be an iterator.