218     uint64_t Now = Target;  in computeAugmentingPathCapacity()  local
219     while (Now != Source) {  in computeAugmentingPathCapacity()
220       uint64_t Pred = Nodes[Now].ParentNode;  in computeAugmentingPathCapacity()
221       auto &Edge = Edges[Pred][Nodes[Now].ParentEdgeIndex];  in computeAugmentingPathCapacity()
227       Now = Pred;  in computeAugmentingPathCapacity()
296     uint64_t Now = Target;  in augmentFlowAlongPath()  local
297     while (Now != Source) {  in augmentFlowAlongPath()
298       uint64_t Pred = Nodes[Now].ParentNode;  in augmentFlowAlongPath()
299       auto &Edge = Edges[Pred][Nodes[Now].ParentEdgeIndex];  in augmentFlowAlongPath()
300       auto &RevEdge = Edges[Now][Edge.RevEdgeIndex];  in augmentFlowAlongPath()
305       Now = Pred;  in augmentFlowAlongPath()
733     uint64_t Now = Target;  in findShortestPath()  local
734     while (Now != Source) {  in findShortestPath()
735       assert(Now == Parent[Now]->Target && "incorrect parent jump");  in findShortestPath()
736       Result.push_back(Parent[Now]);  in findShortestPath()
737       Now = Parent[Now]->Source;  in findShortestPath()