I'm afraid I don't really know the correct teminology do describe this problem, so I'm having trouble looking for generalised solutions.
I have a set of sequences of points I must traverse in order and and I want to combine the set into one long sequence possibly with some points repeated so that it still satisfies the original sequences. So 1) A -> B -> C -> D 2) A -> C -> B -> D 3) B -> C -> A -> D combined together could create a sequence of A -> C -> B -> C -> A -> D 1 1 1 1 2 2 2 2 3 3 3 3 Can anyone advise me what this problem is called, or give me pointers as to a solution? I expect its a part of graph theory or something, but without knowing the right terms its hard to look it up. --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/algogeeks -~----------~----~----~----~------~----~------~--~---