Lines Matching refs:distance
302 NaturalShortestFirstQueue(const vector<W> &distance) :
303 ShortestFirstQueue<S, C>(C(distance, less_)) {}
538 // This constructor takes a state distance vector that, if non-null and if
540 // shortest-first queue using the natural order w.r.t to the distance.
542 AutoQueue(const Fst<Arc> &fst, const vector<typename Arc::Weight> *distance,
568 if (distance && (Weight::Properties() & kPath)) {
570 comp = new Compare(*distance, *less);
731 // an estimate of the shortest distance to the final states.
740 // shortest distance from the initial state, a Less comparison
742 // shortest distance to the final states, this class defines a
769 // estimate E of the shortest distance to the final states, is specialized
777 NaturalAStarQueue(const vector<W> &distance, const E &estimate) :
778 ShortestFirstQueue<S, C>(C(distance, less_, estimate)) {}
795 // shortest distance (so far), as specified by 'distance', is less
796 // than (as specified by 'comp') the shortest distance Times() the
807 PruneQueue(const vector<Weight> &distance, Q *queue, L comp,
810 distance_(distance),
856 const vector<Weight> &distance_; // shortest distance to state
861 vector<Weight> class_distance_; // shortest distance to class
877 NaturalPruneQueue(const vector<W> &distance, Q *queue,
879 PruneQueue<Q, NaturalLess<W>, C>(distance, queue, less_,
