120   void addEdge(uint64_t Src, uint64_t Dst, int64_t Capacity, int64_t Cost) {  in addEdge()  argument
121     assert(Capacity > 0 && "adding an edge of zero capacity");  in addEdge()
127     SrcEdge.Capacity = Capacity;  in addEdge()
134     DstEdge.Capacity = 0;  in addEdge()
215       assert(Edge.Capacity >= Edge.Flow && "incorrect edge flow");  in computeAugmentingPathCapacity()
216       uint64_t EdgeCapacity = uint64_t(Edge.Capacity - Edge.Flow);  in computeAugmentingPathCapacity()
264         if (Edge.Flow < Edge.Capacity) {  in findAugmentingPath()
418         if (Edge->Capacity == INF)  in augmentFlowAlongDAG()
420         uint64_t MaxIntFlow = double(Edge->Capacity - Edge->Flow) / EdgeFlow;  in augmentFlowAlongDAG()
441         EdgeFlow = std::min(EdgeFlow, uint64_t(Edge->Capacity - Edge->Flow));  in augmentFlowAlongDAG()
474         assert(uint64_t(Edge->Capacity - Edge->Flow) >= Edge->AugmentedFlow);  in augmentFlowAlongDAG()
479         if (Edge->Capacity == Edge->Flow && Edge->AugmentedFlow > 0)  in augmentFlowAlongDAG()
509             Edge.Capacity > Edge.Flow &&  in identifyShortestEdges()
510             uint64_t(Edge.Capacity - Edge.Flow) >= MinCapacity;  in identifyShortestEdges()
544     int64_t Capacity;  member