Lines Matching full:shortest
29 #include <fst/extensions/pdt/shortest-path.h>
326 // shortest-stack first queue discipline and relies on the
327 // shortest-distance information computed using a reverse
328 // shortest-path call to perform the pruning.
388 // 1. states corresponding to shortest stack first,
390 // 3. among states with the same stack, shortest-first order is used.
479 SP *reverse_shortest_path_; // Shortest path for rfst_
494 // the shortest-distance from '(s, current_stack_id_)' to the final
544 // Returns the weight of the shortest balanced path from 'source' to 'dest'
570 // Returns the shortest distance from the initial state to 's' in 'ofst_'.
576 // Sets the shortest distance from the initial state to 's' in 'ofst_' to 'w'.
584 // Returns the shortest distance from 's' to the final states in 'ofst_'.
590 // Sets the shortest distance from 's' to the final states in 'ofst_' to 'w'.
712 // Makes 's' final in 'ofst_' if shortest accepting path ending in 's'
737 // 1. considers each (shortest) balanced path starting in 's' by
811 // Checks that shortest path through close paren arc in 'efst_' is
828 // state 't', computes the shortest distance from (t, si) to the final
