133   void addEdge(uint64_t Src, uint64_t Dst, int64_t Capacity, int64_t Cost) {  in addEdge()  argument
134     assert(Capacity > 0 && "adding an edge of zero capacity");  in addEdge()
140     SrcEdge.Capacity = Capacity;  in addEdge()
147     DstEdge.Capacity = 0;  in addEdge()
223       assert(Edge.Capacity >= Edge.Flow && "incorrect edge flow");  in computeAugmentingPathCapacity()
224       uint64_t EdgeCapacity = uint64_t(Edge.Capacity - Edge.Flow);  in computeAugmentingPathCapacity()
272         if (Edge.Flow < Edge.Capacity) {  in findAugmentingPath()
426         if (Edge->Capacity == INF)  in augmentFlowAlongDAG()
428         uint64_t MaxIntFlow = double(Edge->Capacity - Edge->Flow) / EdgeFlow;  in augmentFlowAlongDAG()
449         EdgeFlow = std::min(EdgeFlow, uint64_t(Edge->Capacity - Edge->Flow));  in augmentFlowAlongDAG()
482         assert(uint64_t(Edge->Capacity - Edge->Flow) >= Edge->AugmentedFlow);  in augmentFlowAlongDAG()
487         if (Edge->Capacity == Edge->Flow && Edge->AugmentedFlow > 0)  in augmentFlowAlongDAG()
517             Edge.Capacity > Edge.Flow &&  in identifyShortestEdges()
518             uint64_t(Edge.Capacity - Edge.Flow) >= MinCapacity;  in identifyShortestEdges()
555     int64_t Capacity;  member