Function rustfst::algorithms::shortest_path

source · 
pub fn shortest_path<W, FI, FO>(ifst: &FI) -> Result<FO>
where
    FI: ExpandedFst<W>,
    FO: MutableFst<W>,
    W: Semiring + WeightQuantize + Into<<W as Semiring>::ReverseWeight> + From<<W as Semiring>::ReverseWeight>,
    <W as Semiring>::ReverseWeight: WeightQuantize + WeaklyDivisibleSemiring,
Expand description

Create an FST containing the single shortest path in the input FST. The shortest path is the lowest weight paths w.r.t. the natural semiring order.

§Example

§Input

shortestpath_in

§Output

shortestpath_out_n_1