Beefy Boxes and Bandwidth Generously Provided by pair Networks
Syntactic Confectionery Delight
 
PerlMonks  

Re: find all paths of length n in a graph

by ambrus (Abbot)
on Jan 10, 2006 at 18:07 UTC ( [id://522261]=note: print w/replies, xml ) Need Help??


in reply to find all paths of length n in a graph

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.

boggle -b 'atrieynnilsoelxw' </usr/share/games/bsd-games/boggle/dictio +nary

Log In?
Username:
Password:

What's my password?
Create A New User
Domain Nodelet?
Node Status?
node history
Node Type: note [id://522261]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this?Last hourOther CB clients
Other Users?
Others studying the Monastery: (4)
As of 2024-03-29 11:41 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found