Lines Matching defs:arc
79 // # arcs are equal, check for arc match
213 // allocate arc iterator queue
220 // Prep priority queue. Open arc iterator for each state in C, and
229 // Now pop arc iterator from queue, split entering equivalence class
240 const RevA& arc = aiter->Value();
242 Label from_label = arc.ilabel;
283 // Priority queue of open arc iterators for all states in the 'splitter'
334 // invoked when tree arc examined (to undiscoverted state)
335 bool TreeArc(StateId s, const A& arc) {
339 // invoked when back arc examined (to unfinished state)
340 bool BackArc(StateId s, const A& arc) {
344 // invoked when forward or cross arc examined (to finished state)
345 bool ForwardOrCrossArc(StateId s, const A& arc) {
346 if (height_[arc.nextstate] + 1 > height_[s])
347 height_[s] = height_[arc.nextstate] + 1;
392 // refine states based on arc sort (out degree, arc equivalence)
438 // Each arc is then reconnected to this state. All states in the class
458 A arc = aiter.Value();
459 arc.nextstate = state_map[partition.class_id(arc.nextstate)];
462 aiter.SetValue(arc);
464 fst->AddArc(state_map[c], arc);
