Lines Matching full:shortest
0 // shortest-distance.h
19 // Functions and classes to find shortest distance in an FST.
46 // undefined), compute the shortest-distances along
48 // by the algorithm. That path is the shortest-path
51 // queue discipline is shortest-first and all the
62 // Computation state of the shortest-distance algorithm. Reusable
112 // Compute the shortest distance. If 'source' is kNoStateId, use
222 // Shortest-distance algorithm: this version allows fine control
225 // This computes the shortest distance from the 'opts.source' state to
238 // Shortest-Distance Problems", Journal of Automata, Languages and
257 // Shortest-distance algorithm: simplified interface. See above for a
260 // If 'reverse' is false, this computes the shortest distance from the
262 // 'distance' vector. If 'reverse' is true, this computes the shortest
275 // Shortest-Distance Problems", Journal of Automata, Languages and
319 // the shortest-distance from the initial state to the final states.
