236       Node.Distance = INF;  in findAugmentingPath()
244     Nodes[Source].Distance = 0;  in findAugmentingPath()
264       if (!Params.EvenFlowDistribution && Nodes[Target].Distance == 0)  in findAugmentingPath()
266       if (Nodes[Src].Distance > Nodes[Target].Distance)  in findAugmentingPath()
274           int64_t NewDistance = Nodes[Src].Distance + Edge.Cost;  in findAugmentingPath()
275           if (Nodes[Dst].Distance > NewDistance) {  in findAugmentingPath()
277             Nodes[Dst].Distance = NewDistance;  in findAugmentingPath()
290     return Nodes[Target].Distance != INF;  in findAugmentingPath()
508       if (Nodes[Src].Distance > Nodes[Target].Distance)  in identifyShortestEdges()
515             Nodes[Dst].Distance <= Nodes[Target].Distance &&  in identifyShortestEdges()
516             Nodes[Dst].Distance == Nodes[Src].Distance + Edge.Cost &&  in identifyShortestEdges()
529     int64_t Distance;  member
691     auto Distance = std::vector<int64_t>(NumBlocks(), INF);  in findShortestPath()  local
693     Distance[Source] = 0;  in findShortestPath()
695     Queue.insert(std::make_pair(Distance[Source], Source));  in findShortestPath()
709         if (Distance[Dst] > Distance[Src] + JumpDist) {  in findShortestPath()
710           Queue.erase(std::make_pair(Distance[Dst], Dst));  in findShortestPath()
712           Distance[Dst] = Distance[Src] + JumpDist;  in findShortestPath()
715           Queue.insert(std::make_pair(Distance[Dst], Dst));  in findShortestPath()
723           if (Target == AnyExitBlock || Distance[Target] > Distance[I]) {  in findShortestPath()