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