Lines Matching full:along

77 /// flow is sent along paths of positive capacity from the source to the sink.
84 /// of nodes (source and sink). The output is the flow along each edge of the
107     // flow along its edges  in run()
184   /// flow along its edges. The method returns the number of applied iterations.
215   /// saturated (that is, no flow can be sent along the path), then return 0.
293   /// Update the current flow along the augmenting path.
401   /// Update the current flow along the given (acyclic) subgraph specified by
415     // Phase 1: Send a unit of fractional flow along the DAG  in augmentFlowAlongDAG()
459     // Because of rounding, not all flow can be sent along the edges of Src.  in augmentFlowAlongDAG()
463       // Try to send excess flow back along each edge.  in augmentFlowAlongDAG()
476     // Phase 4: Update flow values along all edges  in augmentFlowAlongDAG()
483         // Update flow values along the edge and its reverse copy  in augmentFlowAlongDAG()
566     /// Extra flow along the edge.
590 ///   and increase the flow by one unit along the path.
630         // Increase the flow along the path  in joinIsolatedComponents()
644   /// Run BFS from a given block along the jumps with a positive flow and mark
778       // Find an unknown subgraphs starting at SrcBlock. Along the way,  in rebalanceUnknownSubgraphs()
985     // SrcBlock's flow is the sum of outgoing flows along non-ignored jumps  in rebalanceUnknownSubgraph()
1294   // Run BFS from the source along edges with positive flow  in verifyOutput()
1311   // along edges with a positive flow  in verifyOutput()