On Tue, 2 Jul 2002 00:26:39 -0700 (PDT) Phil Carmody <[EMAIL PROTECTED]> wrote:
: --- "F. Xavier Noria" <[EMAIL PROTECTED]> wrote: : > I see that point in the rules as a particular case of the fact that : > partial orders are not total. Given this input : > : > a b : > c d : > e e : > : > what would be considered as valid outputs? : : 6 permutations of abcd are possible (..xx, .xx., .x.x both ways), 5 : places where e can go. => 30 in total : : abcde : acbde But c is not less than or equal to b, and d is not comparable with e.... So you print the labels respecting their relative order somehow, and not every pair in the ouput is assumed to be related, so the relation cannot be inferred from it. If a <= b then the output is valid for them just as long as a comes before b. Thank you! -- fxn
