Sorry, nevermind, I completely misread the question, it's obvious now
Would somebody be able to explain exactly what they're asking for in question 5 iii on the June 2007 D1 paper, http://www.mei.org.uk/files/papers/d107ju_3ktw6.pdf
I thought it was asking for the longest route to G -> D (e.g. G-A-B-C-F-E-D = 43) but the answer(s) quote G-B-C-F-E-D and G-B-A-E-D = 41 weight, so I must not be understanding what the question is asking.Find by inspection the route from G to D such that the minimum of the weights for arcs on the route is as large as possible. Give your route and its minimum arc weight. Give an application in which this might be needed.
I'm probably just being stupid and missing something obvious but any help would be greatly appreciated, thanks in advance!
Over the Easter break