This module implements a generalization of Dijkstra's algorithm to find the minimum weight path in a given transducer. The algorithm for transducers are implemented in a fully general way, i.e., for various types of transducers (cf. the various semiring modules).
The implementation is more general than the predicates provided by the SICStus libraries for graphs. And much more efficient, even though the agenda is not maintained as a heap (the latter decision was caused by the fact that it would be hard to implement such a heap efficiently for the various types of transducers with their corresponding `minimum' definitions).
This section lists the predicates defined by this module.
Reports on standard output the minimum weight path in the transducer read from InFile. Flag is an atom indicating the type of transducer.
Reports on standard output (if Path is not present) or instantiates Path to the minimum weight path in the transducer Fa. Flag is an atom indicating the type of transducer.
Array will be instantiated to an UpdatableFsaArray (cf. module fsa_arrays) indicating for each state in the transducer Fa the minimum cost from that state to a final state. Flag is an atom indicating the type of transducer.