On 5/22/07, Roger Hui <[EMAIL PROTECTED]> wrote:
Oh, the solution is easy to describe: Find the edges in the overlap relation. Compute its transitive closure. Read off a longest path. At this point, if you are a real mathematician, you say, problem solved, and go on to the next problem. :-)
Transitive closure does not determine path length. Also, some paths loop (for example, GIRLS GIRLS GIRLS links to itself) so either path length is infinite or an additional requirement is that titles do not repeat. -- Raul ---------------------------------------------------------------------- For information about J forums see http://www.jsoftware.com/forums.htm
