- More liberal type for grammars, now comprising both frozen and mutable structures.
0.2.2
Added
- The canonical version of a grammar can be obtained via the :code:`canonical_grammar` field. The canonical grammar is computed lazily; no performance overhead is to be expected from this change.
0.2.1
Changed
- Added caching to reachability and shortest paths.
0.2.0
Changed
- Bug fix in computation of k-paths; before, the start symbol was not correctly handled and k-paths for reference nodes were faulty. - One can now specify multiple start nodes for the computation of k-paths. The parameter `start_node` has become `start_nodes`.
0.1.1
Added
- Validity check for derivation trees.
Changed
- Corrected representation of grammars with epsilon expansions.
0.1.0
Added
- Converting derivation trees to graph-tool graphs - k-path computation for derivation trees
Changed
- Added a proper type hierarchy for graph nodes (not only structured strings).