Syntactic Confectionery Delight | |
PerlMonks |
Re: find all paths of length n in a graphby ambrus (Abbot) |
on Jan 10, 2006 at 18:07 UTC ( [id://522261]=note: print w/replies, xml ) | Need Help?? |
There's a boggle game in the bsd-games package which is pre-installed on many linux systems or can be installed with the packaging system. You may want to look at or even use its C source. Update: boggle even has a batch mode when you don't play the game, only get the words in a table you specify.
In Section
Seekers of Perl Wisdom
|
|