Module wfst::algorithms::shortestpath

This module implements the shortest path algorithm described in:

Mehryar Mohri and Michael Riley. "An efficient algorithm for the N-best-strings problem," In: Proceedings of the International Conference on Spoken Language Processing 2002 (ICSLP'02), Denver, Colorado, September 2002.

See the source file example_shortestpath.rs for a simple example of intended use.

Functions

shortest_distance	Calculates the shortest distances from each state to the final
shortest_paths	Calculates the n-best shortest path from the initial to the final state