Mark scheme (whole question; this part is marked with the orange bar)

Examiner's comment
Part (a) was generally well answered with the majority of learners knowing that the graph was semi-Eulerian. As the mark scheme did not insist on the work “exactly”, many learners were able to secure this first mark. Learners were able to give a clear textbook definition or state that nodes D and G were odd. Very few gave an incorrect answer or did not give a reason. Part b) was a standard application of Dijkstra’s algorithm and many learners scored full marks; getting the correct quickest path and shortest time. A few learners did not show regard for the order of working values and were penalised heavily for this, but generally the majority scored highly. If mistakes were made, this was most common with the working values at D (missing 18), H (missing 26) or F (additional values). Other marks lost came from errors in the order of labelling, or missing values, although very few learners required the follow through mark and the path and length were generally correct, even with errors on the diagram.
Key points from the mark scheme and examiner's report
- semi-Eulerian: exactly two odd vertices (D and G)








