Ordered Set Algorithm

That is, there may be pairs of components for which neither component precedes the other in the poset. A poset consists of a set together with a binary relation indicate that, for certain pairs of components in the set, one of the components precedes the other in the ordering.

Ordered Set source code, pseudocode and analysis