An augmenting path in residual graph can be found using DFS or BFS. For every edge in the augmenting path, a value of minimum capacity in the path is subtracted from all the edges of that path. An edge of equal amount is added to edges in reverse direction for every successive nodes in the augmenting path.

How do you find the augmenting path of a bipartite graph?

how can one find an M-augmenting path? A graph G = (V,E) is bipartite if there exist A,B ⊆ V with A∪B = V,A∩B = /0 and each edge in E has one end in A and one end in B. A graph G = (V,E) is bipartite if and only if each circuit of G has even length.

What is an augmenting path?

A path constructed by repeatedly finding a path of positive capacity from a source to a sink and then adding it to the flow (Skiena 1990, p. 237). Augmenting paths are used in the blossom algorithm and Hungarian maximum matching algorithm for finding graph maximum matchings. ...