Lines Matching refs:nextstate
159 arc.nextstate < fdistance->size()
160 ? (*fdistance)[arc.nextstate]
163 arc.nextstate = dead[0];
167 if (less(Times(idistance[s], arc.weight), idistance[arc.nextstate]))
168 idistance[arc.nextstate] = Times(idistance[s], arc.weight);
169 if (visited[arc.nextstate]) continue;
173 if (enqueued[arc.nextstate] == kNoKey) {
174 enqueued[arc.nextstate] = heap.Insert(arc.nextstate);
177 heap.Update(enqueued[arc.nextstate], arc.nextstate);
285 arc.nextstate < fdistance->size()
286 ? (*fdistance)[arc.nextstate]
292 while (idistance.size() <= arc.nextstate)
295 idistance[arc.nextstate]))
296 idistance[arc.nextstate] = Times(idistance[s], arc.weight);
297 while (copy.size() <= arc.nextstate)
299 if (copy[arc.nextstate] == kNoStateId)
300 copy[arc.nextstate] = ofst->AddState();
302 copy[arc.nextstate]));
303 while (enqueued.size() <= arc.nextstate) {
307 if (visited[arc.nextstate]) continue;
308 if (enqueued[arc.nextstate] == kNoKey)
309 enqueued[arc.nextstate] = heap.Insert(arc.nextstate);
311 heap.Update(enqueued[arc.nextstate], arc.nextstate);
