228       Node.Distance = INF;  in findAugmentingPath()
236     Nodes[Source].Distance = 0;  in findAugmentingPath()
256       if (!SampleProfileEvenCountDistribution && Nodes[Target].Distance == 0)  in findAugmentingPath()
258       if (Nodes[Src].Distance > Nodes[Target].Distance)  in findAugmentingPath()
266           int64_t NewDistance = Nodes[Src].Distance + Edge.Cost;  in findAugmentingPath()
267           if (Nodes[Dst].Distance > NewDistance) {  in findAugmentingPath()
269             Nodes[Dst].Distance = NewDistance;  in findAugmentingPath()
282     return Nodes[Target].Distance != INF;  in findAugmentingPath()
500       if (Nodes[Src].Distance > Nodes[Target].Distance)  in identifyShortestEdges()
507             Nodes[Dst].Distance <= Nodes[Target].Distance &&  in identifyShortestEdges()
508             Nodes[Dst].Distance == Nodes[Src].Distance + Edge.Cost &&  in identifyShortestEdges()
518     int64_t Distance;  member
679     auto Distance = std::vector<int64_t>(NumBlocks(), INF);  in findShortestPath()  local
681     Distance[Source] = 0;  in findShortestPath()
683     Queue.insert(std::make_pair(Distance[Source], Source));  in findShortestPath()
697         if (Distance[Dst] > Distance[Src] + JumpDist) {  in findShortestPath()
698           Queue.erase(std::make_pair(Distance[Dst], Dst));  in findShortestPath()
700           Distance[Dst] = Distance[Src] + JumpDist;  in findShortestPath()
703           Queue.insert(std::make_pair(Distance[Dst], Dst));  in findShortestPath()
711           if (Target == AnyExitBlock || Distance[Target] > Distance[I]) {  in findShortestPath()