Anagram Program

The DAWG is used in my anagram program. See my article http://dotnetperls.com/Content/Anagram-Windows.aspx.

Big Update

The DawgKit program was cleaned up substantially and is in better shape. Not a lot of real algorithm changes. The code is better
and more factored. It uses more interfaces and some of the supporting code is much better.

Introduction

I have written code in C# that implements the Directed Acyclic Word Graph algorithm and data structure. This sort of data structure is used to design word games such as Scrabble or anagrams and also has usage in scientific pursuits in biology and genetics.

This code page is meant to serve as an outpost for this code. I have a complete implementation in C#. The DAWG algorithms have a dramatic performance advantage over hash tables, sometimes occupying 25% of the memory and also having faster performance. I think these source files can find utility in a broader range of projects, such as a spell-checker, or other string analysis or pattern matching tools.

Important Resources

Implementation details can be found at http://dotnetperls.com/Content/Directed-Acyclic-Word-Graph.aspx. My website is at http://dotnetperls.com/ and I will be optimizing/enhancing this software in a series. Additional sources are available at Google Code http://code.google.com/p/dotnetperls-controls/downloads/list.