Lines Matching defs:weight
40 // Pruning weight threshold.
92 // do not belong to a successful path whose weight is no more than
93 // the weight of the shortest path Times() 'opts.weight_threshold'.
97 // property. The weight 'w' of any cycle needs to be bounded, i.e.,
158 Weight weight = Times(Times(idistance[s], arc.weight),
162 if (less(limit, weight)) {
167 if (less(Times(idistance[s], arc.weight), idistance[arc.nextstate]))
168 idistance[arc.nextstate] = Times(idistance[s], arc.weight);
189 // 'fst' that do not belong to a successful path whose weight is no
190 // more than the weight of the shortest path Times()
194 // have the path property. The weight 'w' of any cycle needs to be
210 // 'ifst' whose weight is no more than the weight of the shortest path
214 // have the path property. The weight 'w' of any cycle needs to be
284 Weight weight = Times(Times(idistance[s], arc.weight),
288 if (less(limit, weight)) continue;
294 if (less(Times(idistance[s], arc.weight),
296 idistance[arc.nextstate] = Times(idistance[s], arc.weight);
301 ofst->AddArc(copy[s], Arc(arc.ilabel, arc.olabel, arc.weight,
320 // successful path in 'ifst' whose weight is no more than
321 // the weight of the shortest path Times() 'weight_threshold'. When
324 // commutative and have the path property. The weight 'w' of any cycle