I am looking for a perl program that will solve the following problem.
Suppose I have 2 or more lists that are (conceptually) sublists of the
same underlying list.
I want to reconstruct the underlying list. In other words the order of
the elements agrees in all the lists, but there is no sort
On Jan 29, 2008 12:11 PM, Tolkin, Steve [EMAIL PROTECTED] wrote:
I want to reconstruct the underlying list. In other words the order of
the elements agrees in all the lists, but there is no sort condition.
Example:
List 1: dog, cat, mouse
List 2: dog, shark, mouse, elephant
There are 2
On Tuesday 29 January 2008 12:11, Tolkin, Steve wrote:
Suppose I have 2 or more lists that are (conceptually) sublists of the
same underlying list.
I want to reconstruct the underlying list. In other words the order of
the elements agrees in all the lists, but there is no sort condition.
On Tue, 29 Jan 2008, Tolkin, Steve wrote:
I want to reconstruct the underlying list. In other words the order of
the elements agrees in all the lists, but there is no sort condition.
Example:
List 1: dog, cat, mouse
List 2: dog, shark, mouse, elephant
There are 2 possible outputs, and
On Tue, Jan 29, 2008 at 12:11:56PM -0500, Tolkin, Steve wrote:
I am looking for a perl program that will solve the following problem.
Suppose I have 2 or more lists that are (conceptually) sublists of the
same underlying list.
I want to reconstruct the underlying list. In other words the
On Jan 29, 2008 10:57 AM, David Golden [EMAIL PROTECTED] wrote:
On Jan 29, 2008 12:11 PM, Tolkin, Steve [EMAIL PROTECTED] wrote:
I want to reconstruct the underlying list. In other words the order of
the elements agrees in all the lists, but there is no sort condition.
Example:
List 1:
On Tue, 2008-01-29 at 12:04 -0800, Ben Tilly wrote:
[snip]
That is logically unavoidable.
Yup, and in fact provably true. The problem is the same as finding a
topological ordering among a directed acyclic graph. Wikipedia can
inform you more on the topic
(
