in reply to "Bookworm" solver project
The Graph module could handle the layout structure just fine. The existence of duplicate letters means that you'll need to encode a distinguishing suffix to the node names, or else store the letter as a property of the node.
It will probably be as important to cook up a data structure for the dictionary which allows sequential lookup by characters. A deep hoh could do that.
After Compline,
Zaxo
|
|---|