Lines Matching defs:graph
70 // Neither the flow graph nor the residual flow graph are represented
71 // explicitly. Instead, they are implied by the information in 'graph' and
74 // where the flow graph is empty, and the residual flow graph has the
79 // corresponding edge exists in 'graph'.
84 // flow graph.
85 // - The same three edges are removed from the residual flow graph.
87 // to the residual flow graph, which is a directional graph
94 // It bears repeating that the flow graph and residual flow graph are
96 // information in 'graph' and in left_.
126 explicit MaxBipartiteMatchState(const MatchMatrix& graph)
127 : graph_(&graph),
135 // Searches the residual flow graph for a path from each left node to
136 // the sink in the residual flow graph, and if one is found, add flow
137 // to the graph. It's okay to search through the left nodes once. The
177 // graph.