Lines Matching defs:arc
86 // # arcs are equal, check for arc match
226 // allocate arc iterator queue
233 // Prep priority queue. Open arc iterator for each state in C, and
242 // Now pop arc iterator from queue, split entering equivalence class
253 const RevA& arc = aiter->Value();
255 Label from_label = arc.ilabel;
296 // Priority queue of open arc iterators for all states in the 'splitter'
347 // invoked when tree arc examined (to undiscoverted state)
348 bool TreeArc(StateId s, const A& arc) {
352 // invoked when back arc examined (to unfinished state)
353 bool BackArc(StateId s, const A& arc) {
357 // invoked when forward or cross arc examined (to finished state)
358 bool ForwardOrCrossArc(StateId s, const A& arc) {
359 if (height_[arc.nextstate] + 1 > height_[s])
360 height_[s] = height_[arc.nextstate] + 1;
405 // refine states based on arc sort (out degree, arc equivalence)
451 // Each arc is then reconnected to this state. All states in the class
471 A arc = aiter.Value();
472 arc.nextstate = state_map[partition.class_id(arc.nextstate)];
475 aiter.SetValue(arc);
477 fst->AddArc(state_map[c], arc);
