Lines Matching defs:graph
144 // Neither the flow graph nor the residual flow graph are represented
145 // explicitly. Instead, they are implied by the information in 'graph' and
148 // where the flow graph is empty, and the residual flow graph has the
153 // corresponding edge exists in 'graph'.
158 // flow graph.
159 // - The same three edges are removed from the residual flow graph.
161 // to the residual flow graph, which is a directional graph
168 // It bears repeating that the flow graph and residual flow graph are
170 // information in 'graph' and in left_.
200 explicit MaxBipartiteMatchState(const MatchMatrix& graph)
201 : graph_(&graph),
210 // Searches the residual flow graph for a path from each left node to
211 // the sink in the residual flow graph, and if one is found, add flow
212 // to the graph. It's okay to search through the left nodes once. The
252 // graph.