Lines Matching refs:Distance
327 // shortest-distance information computed using a reverse
448 Weight Distance(StateId s) const;
471 vector<Weight> distance_; // Distance from initial state in efst_/ofst
472 vector<Weight> fdistance_; // Distance to final states in efst_/ofst
494 // the shortest-distance from '(s, current_stack_id_)' to the final
551 << reverse_shortest_path_->GetShortestPathData().Distance(s);
552 return reverse_shortest_path_->GetShortestPathData().Distance(s);
570 // Returns the shortest distance from the initial state to 's' in 'ofst_'.
572 typename A::Weight PrunedExpand<A>::Distance(StateId s) const {
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'.
625 // * if the distance to 's' times the weight of 'arc' is smaller than
626 // the currently stored distance for 'arc.nextstate',
627 // updates 'Distance(arc.nextstate)' with new estimate;
628 // * if 'fd' is less than the currently stored distance from 'arc.nextstate'
632 Weight nd = Times(Distance(s), arc.weight);
633 if (less_(nd, Distance(arc.nextstate))) {
639 VLOG(2) << "Relax: " << s << ", d[s] = " << Distance(s) << ", to "
640 << arc.nextstate << ", d[ns] = " << Distance(arc.nextstate)
682 Weight w = Times(Distance(s), Times(arc.weight, fd));
687 // the distance data structures.
717 if ((final == Weight::Zero()) || less_(limit_, Times(Distance(s), final)))
798 Weight nd = Times(Distance(s), arc.weight);
799 if(less_(nd, Distance(arc.nextstate)))
815 Weight w = Times(Distance(s),
828 // state 't', computes the shortest distance from (t, si) to the final
905 VLOG(2) << "d[" << s << "] = " << Distance(s)
