Home | History | Annotate | Download | only in fst

Lines Matching full:shortest

0 // shortest-path.h
19 // Functions to find shortest paths in an FST.
33 #include <fst/shortest-distance.h>
44 size_t nshortest; // return n-shortest paths
47 // shortest distance from the initial state
48 bool first_path; // Single shortest path stops after finding the first
49 // path to a final state. That path is the shortest path
66 // Shortest-path algorithm: normally not called directly; prefer
67 // 'ShortestPath' below with n=1. 'ofst' contains the shortest path in
68 // 'ifst'. 'distance' returns the shortest distances from the source
72 // The shortest path is the lowest weight path w.r.t. the natural
249 // N-Shortest-path algorithm: implements the core n-shortest path
253 // 'ofst' contains the REVERSE of 'n'-shortest paths in 'ifst'.
254 // 'distance' must contain the shortest distance from each state to a final
257 // The n-shortest paths are the n-lowest weight paths w.r.t. the
260 // the ith shortest path. Disregarding the initial state and initial
261 // transitions, the n-shortest paths, in fact, form a tree rooted at
269 // the shortest-distance algorithm. There are some issues with the
387 // N-Shortest-path algorithm: this version allow fine control
390 // 'ofst' contains the n-shortest paths in 'ifst'. 'distance' returns
391 // the shortest distances from the source state to each state in
397 // The n-shortest paths are the n-lowest weight paths w.r.t. the
400 // the ith shortest path. Disregarding the initial state and initial
401 // transitions, The n-shortest paths, in fact, form a tree rooted at
410 // the shortest-distance algorithm. There are some issues with the
427 FSTERROR() << "ShortestPath: n-shortest: Weight needs to have the "
442 // reverse of the tree of n-shortest path in 'rfst'.
469 // Shortest-path algorithm: simplified interface. See above for a
472 // 'ofst' contains the 'n'-shortest paths in 'ifst'. The queue
476 // The n-shortest paths are the n-lowest weight paths w.r.t. the