96     Edges = std::vector<std::vector<Edge>>(NodeCount, std::vector<Edge>());  in initialize()
114       for (auto &Edge : Edges[Src]) {  in run()
142     SrcEdge.RevEdgeIndex = Edges[Dst].size();  in addEdge()
149     DstEdge.RevEdgeIndex = Edges[Src].size();  in addEdge()
151     Edges[Src].push_back(SrcEdge);  in addEdge()
152     Edges[Dst].push_back(DstEdge);  in addEdge()
164     for (const auto &Edge : Edges[Src]) {  in getFlow()
174     for (const auto &Edge : Edges[Src]) {  in getFlow()
221       auto &Edge = Edges[Pred][Nodes[Now].ParentEdgeIndex];  in computeAugmentingPathCapacity()
270       for (uint64_t EdgeIdx = 0; EdgeIdx < Edges[Src].size(); EdgeIdx++) {  in findAugmentingPath()
271         auto &Edge = Edges[Src][EdgeIdx];  in findAugmentingPath()
299       auto &Edge = Edges[Pred][Nodes[Now].ParentEdgeIndex];  in augmentFlowAlongPath()
300       auto &RevEdge = Edges[Now][Edge.RevEdgeIndex];  in augmentFlowAlongPath()
346       if (EdgeIdx < Edges[NodeIdx].size()) {  in findAugmentingDAG()
347         auto &Edge = Edges[NodeIdx][EdgeIdx];  in findAugmentingDAG()
387       for (auto &Edge : Edges[Src]) {  in findAugmentingDAG()
484         auto &RevEdge = Edges[Edge->Dst][Edge->RevEdgeIndex];  in augmentFlowAlongDAG()
511       for (auto &Edge : Edges[Src]) {  in identifyShortestEdges()
573   std::vector<std::vector<Edge>> Edges;  member in __anon5aecd1f00111::MinCostMaxFlow