210     uint64_t Now = Target;  in computeAugmentingPathCapacity()  local
211     while (Now != Source) {  in computeAugmentingPathCapacity()
212       uint64_t Pred = Nodes[Now].ParentNode;  in computeAugmentingPathCapacity()
213       auto &Edge = Edges[Pred][Nodes[Now].ParentEdgeIndex];  in computeAugmentingPathCapacity()
219       Now = Pred;  in computeAugmentingPathCapacity()
288     uint64_t Now = Target;  in augmentFlowAlongPath()  local
289     while (Now != Source) {  in augmentFlowAlongPath()
290       uint64_t Pred = Nodes[Now].ParentNode;  in augmentFlowAlongPath()
291       auto &Edge = Edges[Pred][Nodes[Now].ParentEdgeIndex];  in augmentFlowAlongPath()
292       auto &RevEdge = Edges[Now][Edge.RevEdgeIndex];  in augmentFlowAlongPath()
297       Now = Pred;  in augmentFlowAlongPath()
721     uint64_t Now = Target;  in findShortestPath()  local
722     while (Now != Source) {  in findShortestPath()
723       assert(Now == Parent[Now]->Target && "incorrect parent jump");  in findShortestPath()
724       Result.push_back(Parent[Now]);  in findShortestPath()
725       Now = Parent[Now]->Source;  in findShortestPath()