kawu / dawg

Directed acyclic word graphs
BSD 2-Clause "Simplified" License
11 stars 1 forks source link

Keep weights in transition labels #7

Closed kawu closed 11 years ago

kawu commented 11 years ago

In static representation of the automaton, weights should be moved from nodes to edges. It will allow to implement fast, O(|w| * log(|A|)) indexing operations, where w denotes input word and A denotes alphabet.

On the other hand, it will increase the size of the graph, since there will be additional integer number stored for each edge in the graph.