D1 June 2019 Q1

EdexcelOld spec7 marksAllocation

1.

Figure 1: bipartite graph joining people A to F to tasks 1 to 6
Figure 1
Figure 2: initial matching A to 3, C to 5, E to 6, F to 1
Figure 2

Figure 1 shows the possible allocations of six people, A, B, C, D, E and F, to six tasks, 1, 2, 3, 4, 5 and 6

(a) Write down the technical name given to the type of diagram shown in Figure 1. (1)

Figure 2 shows an initial matching.

(b) Starting from the given initial matching, use the maximum matching algorithm to find a complete matching. You should list the alternating paths you use and state your improved matching after each iteration. (6)