Definition 39: Given a matching M in a graph G, a M-alternating path(cycle) is a path(cycle) in g whose edges are alternately in m and outside ofm(i.e. if an edge of the path is in M, the next edge is outside M and vice versa). A M alternating path whose end vertices are M unsaturated is called an M-augmenting path. 2 vO y y▪ Definition 39: Given a matching M in a graph G, a M-alternating path (cycle) is a path (cycle) in G whose edges are alternately in M and outside of M (i.e. if an edge of the path is in M, the next edge is outside M and vice versa). A M￾alternating path whose end vertices are M￾unsaturated is called an M-augmenting path