Content deleted Content added
m A queue is first in first out not last in first out (stack). |
→Definition: Added definition of symmetric difference between sets of edges |
||
Line 13:
* An alternating path is 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 P is an alternating path such that both its end points are free vertices.
* Symmetric difference <math>M'=M\oplus P</math> has all edges of M and P except shared edges <math>M\cap P</math>
== Algorithm ==
| |||