Lines Matching full:left

66 // bipartite matching. Flow is considered to be from left to right.
67 // There is an implicit source node that is connected to all of the left
105 // left[l] == kUnused or right[left[l]] == l
106 // right[r] == kUnused or left[right[r]] == r
111 // .   ||\--> left[0]=1  ---\    right[0]=-1 ----\     .
113 // .   |\---> left[1]=-1    \--> right[1]=0  ---\|     .
115 // .   \----> left[2]=2  ------> right[2]=2  --\||     .
132   // Returns the edges of a maximal match, each in the form {left, right}.
136     // Searches the residual flow graph for a path from each left node to  in Compute()
138     // to the graph. It's okay to search through the left nodes once. The  in Compute()
139     // edge from the implicit source node to each previously-visited left  in Compute()
140     // node will have flow if that left node has any path to the sink  in Compute()
143     // Since the source-to-left edge can only carry one flow unit (or,  in Compute()
145     // to visit the left nodes more than once looking for augmented paths.  in Compute()
169   // Perform a depth-first search from left node ilhs to the sink.  If a
170   // path is found, flow is added to the network by linking the left and
176   // Left nodes will only be explored at most once because they
212   // Each element of the left_ vector represents a left hand side node