Content deleted Content added
Just added the basic definition and the basic idea behind the algorithm. Would add more tomorrow. |
|||
Line 14:
Consider a graph G(V,E).
- An alternating path would be a path in which the edges would belong alternatively to M and E-M.
- A free vertex is a vertex which has no incoming edges which belong to M.
- Finally, an augmenting path is an alternating path such that both its end points are free vertices.
== Algorithm ==
| |||