[Top][All Lists]
[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Re: sorting by a partial order
From: |
Thien-Thi Nguyen |
Subject: |
Re: sorting by a partial order |
Date: |
Tue, 29 Oct 2002 23:27:49 -0800 |
From: Keith Wright <address@hidden>
Date: Wed, 30 Oct 2002 01:34:45 -0500
I can't define "defines" to somebody
confused about definitions.
that would be a feat, indeed. i took "predicate" to refer to only the
relation, w/o the set. if OP had used the term "poset" directly, and
not used "predicate" in the context of the less-function argument to
`sort', i would not have been (as) confused.
Knuth calls this a topological sort.
I'm not sure if anybody else does.
check out the tsort (GNU textutils) info page.
thi