85     Edges = std::vector<std::vector<Edge>>(NodeCount, std::vector<Edge>());  in initialize()
101       for (auto &Edge : Edges[Src]) {  in run()
129     SrcEdge.RevEdgeIndex = Edges[Dst].size();  in addEdge()
136     DstEdge.RevEdgeIndex = Edges[Src].size();  in addEdge()
138     Edges[Src].push_back(SrcEdge);  in addEdge()
139     Edges[Dst].push_back(DstEdge);  in addEdge()
151     for (auto &Edge : Edges[Src]) {  in getFlow()
161     for (auto &Edge : Edges[Src]) {  in getFlow()
213       auto &Edge = Edges[Pred][Nodes[Now].ParentEdgeIndex];  in computeAugmentingPathCapacity()
262       for (uint64_t EdgeIdx = 0; EdgeIdx < Edges[Src].size(); EdgeIdx++) {  in findAugmentingPath()
263         auto &Edge = Edges[Src][EdgeIdx];  in findAugmentingPath()
291       auto &Edge = Edges[Pred][Nodes[Now].ParentEdgeIndex];  in augmentFlowAlongPath()
292       auto &RevEdge = Edges[Now][Edge.RevEdgeIndex];  in augmentFlowAlongPath()
338       if (EdgeIdx < Edges[NodeIdx].size()) {  in findAugmentingDAG()
339         auto &Edge = Edges[NodeIdx][EdgeIdx];  in findAugmentingDAG()
379       for (auto &Edge : Edges[Src]) {  in findAugmentingDAG()
476         auto &RevEdge = Edges[Edge->Dst][Edge->RevEdgeIndex];  in augmentFlowAlongDAG()
503       for (auto &Edge : Edges[Src]) {  in identifyShortestEdges()
562   std::vector<std::vector<Edge>> Edges;  member in __anon646eb3200111::MinCostMaxFlow