# data[].attributes.body
When finding an alternating path, remember to alternate between the bipartite graph and the initial matching until breakthrough is achieved. It helps to draw these graphs side by side.

# data[].attributes.body
If the question says ... "Explain why it is not possible to find a complete matching" ... give an example to illustrate your answer. These questions are usually worth 2 marks. For example,

Hugo is the only one who can do Task 1 and Task 3. If Hugo is allocated to Task 1, there is no one available to do Task 3 and so a complete matching is not possible

# data[].attributes.body
The maximum matching algorithm adds one edge to the initial matching.

# data[].attributes.body
Remember that a maximum matching may or may not be a complete matching.