PQ Tree Solution for the Contiguous Ordering Problem
Input: A universe U and a set S = {S1, S2, ..., Sm} of subsets of U.
Output: A PQ tree T with leaves U with the property that PQ(T) is the set of all orderings of U where each set in S is contiguous in the ordering.