133   void addEdge(uint64_t Src, uint64_t Dst, int64_t Capacity, int64_t Cost) {  in addEdge()  argument
135     assert(Src != Dst && "loop edge are not supported");  in addEdge()
138     SrcEdge.Dst = Dst;  in addEdge()
142     SrcEdge.RevEdgeIndex = Edges[Dst].size();  in addEdge()
145     DstEdge.Dst = Src;  in addEdge()
152     Edges[Dst].push_back(DstEdge);  in addEdge()
156   void addEdge(uint64_t Src, uint64_t Dst, int64_t Cost) {  in addEdge()  argument
157     addEdge(Src, Dst, INF, Cost);  in addEdge()
166         Flow.push_back(std::make_pair(Edge.Dst, Edge.Flow));  in getFlow()
172   int64_t getFlow(uint64_t Src, uint64_t Dst) const {  in getFlow()
175       if (Edge.Dst == Dst) {  in getFlow()
273           uint64_t Dst = Edge.Dst;  in findAugmentingPath()  local
275           if (Nodes[Dst].Distance > NewDistance) {  in findAugmentingPath()
277             Nodes[Dst].Distance = NewDistance;  in findAugmentingPath()
278             Nodes[Dst].ParentNode = Src;  in findAugmentingPath()
279             Nodes[Dst].ParentEdgeIndex = EdgeIdx;  in findAugmentingPath()
281             if (!Nodes[Dst].Taken) {  in findAugmentingPath()
282               Queue.push(Dst);  in findAugmentingPath()
283               Nodes[Dst].Taken = true;  in findAugmentingPath()
348         auto &Dst = Nodes[Edge.Dst];  in findAugmentingDAG()  local
353           if (Dst.Discovery == 0 && Dst.NumCalls < MaxDfsCalls) {  in findAugmentingDAG()
354             Dst.Discovery = ++Time;  in findAugmentingDAG()
355             Stack.emplace(Edge.Dst, 0);  in findAugmentingDAG()
356             Dst.NumCalls++;  in findAugmentingDAG()
357           } else if (Dst.Taken && Dst.Finish != 0) {  in findAugmentingDAG()
388         uint64_t Dst = Edge.Dst;  in findAugmentingDAG()  local
389         if (Edge.OnShortestPath && Nodes[Src].Taken && Nodes[Dst].Taken &&  in findAugmentingDAG()
390             Nodes[Dst].Finish < Nodes[Src].Finish) {  in findAugmentingDAG()
425         Nodes[Edge->Dst].FracFlow += EdgeFlow;  in augmentFlowAlongDAG()
447         uint64_t Dst = Edge->Dst;  in augmentFlowAlongDAG()  local
450         Nodes[Dst].IntFlow += EdgeFlow;  in augmentFlowAlongDAG()
466         uint64_t Dst = Edge->Dst;  in augmentFlowAlongDAG()  local
467         if (Nodes[Dst].IntFlow == 0)  in augmentFlowAlongDAG()
469         uint64_t EdgeFlow = std::min(Nodes[Dst].IntFlow, Edge->AugmentedFlow);  in augmentFlowAlongDAG()
470         Nodes[Dst].IntFlow -= EdgeFlow;  in augmentFlowAlongDAG()
484         auto &RevEdge = Edges[Edge->Dst][Edge->RevEdgeIndex];  in augmentFlowAlongDAG()
512         uint64_t Dst = Edge.Dst;  in identifyShortestEdges()  local
514             Src != Target && Dst != Source &&  in identifyShortestEdges()
515             Nodes[Dst].Distance <= Nodes[Target].Distance &&  in identifyShortestEdges()
516             Nodes[Dst].Distance == Nodes[Src].Distance + Edge.Cost &&  in identifyShortestEdges()
559     uint64_t Dst;  member
656         uint64_t Dst = Jump->Target;  in findReachable()  local
657         if (Jump->Flow > 0 && !Visited[Dst]) {  in findReachable()
658           Queue.push(Dst);  in findReachable()
659           Visited[Dst] = true;  in findReachable()
707         uint64_t Dst = Jump->Target;  in findShortestPath()  local
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()
713           Parent[Dst] = Jump;  in findShortestPath()
715           Queue.insert(std::make_pair(Distance[Dst], Dst));  in findShortestPath()
842         uint64_t Dst = Jump->Target;  in findUnknownSubgraph()  local
844         if (Visited[Dst])  in findUnknownSubgraph()
847         Visited[Dst] = true;  in findUnknownSubgraph()
848         if (!Func.Blocks[Dst].HasUnknownWeight) {  in findUnknownSubgraph()
849           KnownDstBlocks.push_back(&Func.Blocks[Dst]);  in findUnknownSubgraph()
851           Queue.push(Dst);  in findUnknownSubgraph()
852           UnknownBlocks.push_back(&Func.Blocks[Dst]);  in findUnknownSubgraph()
960         uint64_t Dst = Jump->Target;  in isAcyclicSubgraph()  local
961         LocalInDegree[Dst]--;  in isAcyclicSubgraph()
962         if (LocalInDegree[Dst] == 0) {  in isAcyclicSubgraph()
963           Queue.push(Dst);  in isAcyclicSubgraph()
1302     for (uint64_t Dst : PositiveFlowEdges[Src]) {  in verifyOutput()  local
1303       if (!Visited[Dst]) {  in verifyOutput()
1304         Queue.push(Dst);  in verifyOutput()
1305         Visited[Dst] = true;  in verifyOutput()