Hi John,
2008/2/11, John <[EMAIL PROTECTED]>:
> Now, on to my problem. Topographical sorting essentially involves removing
> the minimal element in a set (1), and then arbitrarily choosing the next
> minimal element and removing it as well. So, after removing 1, one could
> remo
I'm working on a project involving the topographical sorting of partially
ordered sets (posets), using the poset (S, |), where S is the set of
integers <= n. Ultimately, I need to determine all possible topographical
sorts for whatever n happens to be. This requires me to be able to b
