Lines Matching refs:Source
92 Source = SourceNode; in initialize()
117 if (Src == Source) in run()
219 while (Now != Source) { in computeAugmentingPathCapacity()
243 Queue.push(Source); in findAugmentingPath()
244 Nodes[Source].Distance = 0; in findAugmentingPath()
245 Nodes[Source].Taken = true; in findAugmentingPath()
297 while (Now != Source) { in augmentFlowAlongPath()
339 Stack.emplace(Source, 0); in findAugmentingDAG()
340 Nodes[Source].Discovery = ++Time; in findAugmentingDAG()
373 if (NodeIdx != Source) { in findAugmentingDAG()
417 Nodes[Source].FracFlow = 1.0; in augmentFlowAlongDAG()
437 Nodes[Source].IntFlow = MaxFlowAmount; in augmentFlowAlongDAG()
480 assert(Src == Source || Nodes[Src].IntFlow == 0); in augmentFlowAlongDAG()
514 Src != Target && Dst != Source && in identifyShortestEdges()
575 uint64_t Source; member in __anon08a240e50111::MinCostMaxFlow
631 assert(Path.size() > 0 && Path[0]->Source == Func.Entry && in joinIsolatedComponents()
683 std::vector<FlowJump *> findShortestPath(uint64_t Source, uint64_t Target) { in findShortestPath() argument
685 if (Source == Target) in findShortestPath()
687 if (Func.Blocks[Source].isExit() && Target == AnyExitBlock) in findShortestPath()
693 Distance[Source] = 0; in findShortestPath()
695 Queue.insert(std::make_pair(Distance[Source], Source)); in findShortestPath()
734 while (Now != Source) { in findShortestPath()
737 Now = Parent[Now]->Source; in findShortestPath()
903 auto JumpSource = &Func.Blocks[Jump->Source]; in ignoreJump()
1107 uint64_t Jin = 2 * Jump.Source + 1; in initializeNetwork()
1165 if (Jump.Source + 1 == Jump.Target) { in assignJumpCosts()
1172 if (Jump.Source + 1 == Jump.Target) in assignJumpCosts()
1192 uint64_t SrcOut = 2 * Jump.Source + 1; in extractWeights()
1197 if (Jump.Source != Jump.Target) in extractWeights()
1211 OutFlow[Jump.Source] += Jump.Flow; in extractWeights()
1264 OutFlow[Jump.Source] += Jump.Flow; in verifyOutput()
1290 PositiveFlowEdges[Jump.Source].push_back(Jump.Target); in verifyOutput()