HomeSort by relevance Sort by last modified time
    Searched refs:rfst (Results 1 - 2 of 2) sorted by null

  /external/srec/tools/thirdparty/OpenFst/fst/lib/
shortest-distance.h 246 VectorFst<ReverseArc> rfst; local
247 Reverse(fst, &rfst);
249 AutoQueue<StateId> state_queue(rfst, &rdistance, rarc_filter);
253 ShortestDistance(rfst, &rdistance, ropts);
shortest-path.h 255 // Algorithm works on the reverse of 'fst' : 'rfst' 'distance' is
256 // the distance to the final state in 'rfst' 'ofst' is built as the
257 // reverse of the tree of n-shortest path in 'rfst'.
261 VectorFst<ReverseArc> rfst; local
262 Reverse(ifst, &rfst);
264 while (distance->size() < rfst.NumStates())
269 // initial state of 'rfst' to a state s in 'rfst', that can be
290 pairs[final] = Pair(rfst.Start(), Weight::One());
307 for (ArcIterator< Fst<ReverseArc> > aiter(rfst, p.first)
    [all...]

Completed in 578 milliseconds