Lines Matching refs:nextstate
159 while (distance->size() <= arc.nextstate) { in SingleShortestPath()
166 Weight &nd = (*distance)[arc.nextstate]; in SingleShortestPath()
174 parent[arc.nextstate] = s; in SingleShortestPath()
175 arc_parent[arc.nextstate] = arc; in SingleShortestPath()
176 if (!enqueued[arc.nextstate]) { in SingleShortestPath()
177 state_queue->Enqueue(arc.nextstate); in SingleShortestPath()
178 enqueued[arc.nextstate] = true; in SingleShortestPath()
180 state_queue->Update(arc.nextstate); in SingleShortestPath()
195 arc_parent[d].nextstate = d_p; in SingleShortestPath()
359 Arc arc(rarc.ilabel, rarc.olabel, rarc.weight.Reverse(), rarc.nextstate);
362 pairs.push_back(Pair(arc.nextstate, w));
363 arc.nextstate = state;
449 StateId s = arc.nextstate - 1; in ShortestPath()