in reply to Not Quite Longest Path Problem

Level 2 sounds like it could be represented by 26 copies of the original graph, with a subset of the nodes (those containing the letter you chose to use first) removed from each copy. You essentially must choose which of the 26 variant subgraphs you want to play in, and then throw the others away.

Level 3 could be four copies of the graph, but for each link, you alter it to point to the corresponding node in Copy #N if that link changes letter #N. Then clean up by deleting any links that go from Copy N to Copy M where N==M.
The graph will have to become directed, since you can go from moon(1) to mood(4) or mood(1) to moon(4) but not mood(4) to moon(1)

Replies are listed 'Best First'.
Re^2: Not Quite Longest Path Problem
by Limbic~Region (Chancellor) on Oct 23, 2009 at 23:23 UTC
    SuicideJunkie,
    Yes, I am sure one could continue to think in terms of graphs but do you think it will be of any use. In other words, I think it becomes more complex not less. At least, more complex than I am willing to invest to wow and amaze friends.

    Cheers - L~R

[reply]

In Section Seekers of Perl Wisdom