A directed acyclic word graph.
A directed acyclic word graph with character type
a and dictionary
b. Each node is represented by a unique integer number
which is also an index of the node in the vector of DAWG nodes.
A node in the DAWG.
Find and eliminate all common subtries in the input trie and return the trie represented as a DAWG.