Lines Matching defs:Edge

96     Edges = std::vector<std::vector<Edge>>(NodeCount, std::vector<Edge>());
99           std::vector<std::vector<Edge *>>(NodeCount, std::vector<Edge *>());
114       for (auto &Edge : Edges[Src]) {
115         if (Edge.Flow > 0) {
116           TotalCost += Edge.Cost * Edge.Flow;
118             TotalFlow += Edge.Flow;
137     Edge SrcEdge;
144     Edge DstEdge;
164     for (const auto &Edge : Edges[Src]) {
165       if (Edge.Flow > 0)
166         Flow.push_back(std::make_pair(Edge.Dst, Edge.Flow));
174     for (const auto &Edge : Edges[Src]) {
175       if (Edge.Dst == Dst) {
176         Flow += Edge.Flow;
221       auto &Edge = Edges[Pred][Nodes[Now].ParentEdgeIndex];
223       assert(Edge.Capacity >= Edge.Flow && "incorrect edge flow");
224       uint64_t EdgeCapacity = uint64_t(Edge.Capacity - Edge.Flow);
271         auto &Edge = Edges[Src][EdgeIdx];
272         if (Edge.Flow < Edge.Capacity) {
273           uint64_t Dst = Edge.Dst;
274           int64_t NewDistance = Nodes[Src].Distance + Edge.Cost;
299       auto &Edge = Edges[Pred][Nodes[Now].ParentEdgeIndex];
300       auto &RevEdge = Edges[Now][Edge.RevEdgeIndex];
302       Edge.Flow += PathCapacity;
311   /// edge out of a node, continue search at Edge.Dst endpoint if it has not
347         auto &Edge = Edges[NodeIdx][EdgeIdx];
348         auto &Dst = Nodes[Edge.Dst];
351         if (Edge.OnShortestPath) {
352           // If we haven't seen Edge.Dst so far, continue DFS search there
355             Stack.emplace(Edge.Dst, 0);
358             // Else, if Edge.Dst already have a path to Target, so that NodeIdx
387       for (auto &Edge : Edges[Src]) {
388         uint64_t Dst = Edge.Dst;
389         if (Edge.OnShortestPath && Nodes[Src].Taken && Nodes[Dst].Taken &&
391           AugmentingEdges[Src].push_back(&Edge);
410       for (auto &Edge : AugmentingEdges[Src]) {
411         Edge->AugmentedFlow = 0;
423       for (auto &Edge : AugmentingEdges[Src]) {
425         Nodes[Edge->Dst].FracFlow += EdgeFlow;
426         if (Edge->Capacity == INF)
428         uint64_t MaxIntFlow = double(Edge->Capacity - Edge->Flow) / EdgeFlow;
446       for (auto &Edge : AugmentingEdges[Src]) {
447         uint64_t Dst = Edge->Dst;
449         EdgeFlow = std::min(EdgeFlow, uint64_t(Edge->Capacity - Edge->Flow));
452         Edge->AugmentedFlow += EdgeFlow;
465       for (auto &Edge : AugmentingEdges[Src]) {
466         uint64_t Dst = Edge->Dst;
469         uint64_t EdgeFlow = std::min(Nodes[Dst].IntFlow, Edge->AugmentedFlow);
472         Edge->AugmentedFlow -= EdgeFlow;
481       for (auto &Edge : AugmentingEdges[Src]) {
482         assert(uint64_t(Edge->Capacity - Edge->Flow) >= Edge->AugmentedFlow);
484         auto &RevEdge = Edges[Edge->Dst][Edge->RevEdgeIndex];
485         Edge->Flow += Edge->AugmentedFlow;
486         RevEdge.Flow -= Edge->AugmentedFlow;
487         if (Edge->Capacity == Edge->Flow && Edge->AugmentedFlow > 0)
511       for (auto &Edge : Edges[Src]) {
512         uint64_t Dst = Edge.Dst;
513         Edge.OnShortestPath =
516             Nodes[Dst].Distance == Nodes[Src].Distance + Edge.Cost &&
517             Edge.Capacity > Edge.Flow &&
518             uint64_t(Edge.Capacity - Edge.Flow) >= MinCapacity;
551   struct Edge {
573   std::vector<std::vector<Edge>> Edges;
579   std::vector<std::vector<Edge *>> AugmentingEdges;