Other items inrustfst::algorithms
pub fn top_sort<W, F>(fst: &mut F) -> Result<()> where W: Semiring, F: MutableFst<W>,
This operation topologically sorts its input. When sorted, all transitions are from lower to higher state IDs.