12 (e) A matching problem has been turned into a maximum flow problem for a transport network using the method described

[answerhappygod]

12 E A Matching Problem Has Been Turned Into A Maximum Flow Problem For A Transport Network Using The Method Described 1 (69.77 KiB) Viewed 33 times

12 (e) A matching problem has been turned into a maximum flow problem for a transport network using the method described in the course. The resulting directed graph is shown below. Use the vertex labelling algorithm described in the course to solve the matching problem (pseudocode for the vertex-labeling algorithm is given at the end of the exam paper). The first incremental flow is shown on the diagram below and recorded in the first table below. Record each subsequent incremental flow in the first table below (use only as many rows as you need), and record the final matching in the second table. Fo with fi incremental path of incremental flow flow label fi SAW t vertex The vertex, if any, with which it is matched A B C D 13