Clear questions and runnable code get the best and fastest answer |
|
PerlMonks |
comment on |
( [id://3333]=superdoc: print w/replies, xml ) | Need Help?? |
Not to take away your fun on what looks like an interesting programming problem, you might also look at Bookworm by PopCap software. I've enjoyed it immensely -- good value for $20. Update: And of course, there is always Big Boggle, which uses a 5 x 5 grid -- makes the problem a little more interesting. No good deed goes unpunished. -- (attributed to) Oscar Wilde In reply to Re: find all paths of length n in a graph
by ptum
|
|